Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. On logarithmic asymptotics for the number of restricted partitions in the exponential case: Label: en
  2. On moments of gaps between consecutive square-free numbers: Label: en
  3. On asymptotic local Turán problems: Label: en
  4. On Furstenberg's Diophantine result: Label: en
  5. On a problem related to ``second best approximations to a real number: Label: en
  6. On distance graphs in rational spaces: Label: en
  7. A note on monogenity of certain pure number fields defined by \(x^{p^r} - a\) with non-square-free parameter: Label: en
  8. Integer sequences without singleton intersection: Label: en
  9. On the size of \(A+ \lambda A\) for algebraic \(\lambda \): Label: en
  10. An improved convergence case for Diophantine approximations on IFS fractals: Label: en
  11. On families with bounded matching number: Label: en
  12. Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs: Label: en
  13. On a sum involving squarefull numbers. II: Label: en
  14. Borsuk's problem, Boltyanski's illumination problem, and circumradius: Label: en
  15. On the maximum size packings of disks with kissing radius 3: Label: en
  16. Additive properties for sets of polynomial values: Label: en
  17. On the size of the product of overlapping families: Label: en
  18. Uniformly distributed sequences generated by a greedy minimization of the \(L_2\) discrepancy: Label: en
  19. On the zeros of the derivatives of certain polynomials: Label: en
  20. Personalized PageRank with node-dependent restart: Label: en
  21. Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems: Label: en
  22. Estimating the strong \(r\)-colorability threshold in random hypergraphs: Label: en
  23. Combinatorics of Serre weights in the potentially Barsotti-Tate setting: Label: en
  24. Combinatorial sums \(\sum_{k\equiv r(\operatorname{mod} m)}\binom{n}{k}a^k\) and Lucas quotients: Label: en
  25. On-line and list on-line colorings of graphs and hypergraphs: Label: en
  26. Precise error estimate of the Brent-McMillan algorithm for Euler's constant: Label: en
  27. Corrigendum to ``On the maximum number of consecutive integers on which a character is constant: Label: en
  28. A remark on Hamilton cycles with few colors: Label: en
  29. On the Littlewood conjecture in \(\mathbb{Z}/p\mathbb{Z}\): Label: en
  30. On distinct cross-ratios and related growth problems: Label: en
  31. On the distribution of values of Hardy's \(Z\)-function in short intervals: Label: en
  32. Antichains of fixed diameter: Label: en
  33. Voronoi's conjecture for extensions of Voronoi parallelohedra: Label: en
  34. On the large values of the Riemann zeta-function on the critical line. II.: Label: en
  35. On products of \(k\) atoms. II.: Label: en
  36. Choosability in simple hypergraphs: Label: en
  37. Uni-dimensional models of coalition formation: non-existence of stable partitions: Label: en
  38. Counterexamples to Borsuk's conjecture on spheres of small radii: Label: en
  39. Disjoint edges in separated hypergraphs: Label: en
  40. On groups with perfect order subsets: Label: en
  41. On a theorem of Hildebrand: Label: en
  42. A note on the set \(A(A + A)\): Label: en
  43. Lattices with exponentially large kissing numbers: Label: en
  44. The Lind-Lehmer constant for \(\mathbb{Z}_2^r\times\mathbb{Z}_4^s\): Label: en
  45. A family of four-variable expanders with quadratic growth: Label: en
  46. Matiyasevich-type identities for hypergeometric Bernoulli polynomials and poly-Bernoulli polynomials: Label: en
  47. Identity involving symmetric sums of regularized multiple zeta-star values: Label: en
  48. Embeddings of weighted graphs in Erdős-type settings: Label: en
  49. On the quotient set of the distance set: Label: en
  50. A simple proof of the Hilton-Milner theorem: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)