English
Related papers

Related papers: Packing Posets in the Boolean Lattice

200 papers

In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of…

Mathematical Physics · Physics 2017-05-10 Johann Bartel , R. K. Bhaduri , Matthias Brack , M. V. N. Murthy

We prove asymptotics for Serre's problem on the number of diagonal planar conics with a rational point and use this to put forward a new conjecture on counting the number of varieties in a family which are everywhere locally soluble.

Number Theory · Mathematics 2024-10-21 Daniel Loughran , Nick Rome , Efthymios Sofos

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

Logic · Mathematics 2020-06-30 Ivan Chajda , Helmut Länger

Let $\{X_i\}_{i=1}^{\infty}$ be a sequence of independent copies of a random vector $X$ in $\mathbb{R}^n$. We revisit the question to determine the asymptotic shape of the random polytope $K_N={\rm conv}\{X_1,\ldots ,X_N\}$ where $N>n$. We…

Metric Geometry · Mathematics 2025-08-22 Minas Pafis , Natalia Tziotziou

We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\{1,\ldots,n\}$. Our approach is based on the result of Pr\"omel and Steger that almost all perfect graphs are…

Combinatorics · Mathematics 2017-09-07 Colin McDiarmid , Nikola Yolov

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

Let $P$ be a finite poset. Let $L:=J(P)$ denote the lattice of order ideals of $P$. Let $b_i(L)$ denote the number of Boolean intervals of $L$ of rank $i$. We construct a simple graph $G(P)$ from our poset $P$. Denote by $f_i(P)$ the number…

Commutative Algebra · Mathematics 2016-10-10 Gábor Hegedüs

Let $u_k(G,p)$ be the maximum over all $k$-vertex graphs $F$ of by how much the number of induced copies of $F$ in $G$ differs from its expectation in the binomial random graph with the same number of vertices as $G$ and with edge…

Combinatorics · Mathematics 2018-06-12 Humberto Naves , Oleg Pikhurko , Alex Scott

How large can a family \cal A \subset \cal P [n] be if it does not contain A,B with |A\setminus B| = 1? Our aim in this paper is to show that any such family has size at most \frac{2+o(1)}{n} \binom {n}{\lfloor n/2\rfloor }. This is tight…

Combinatorics · Mathematics 2013-11-25 Imre Leader , Eoin Long

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

Combinatorics · Mathematics 2012-09-05 Sara Billey , Krzysztof Burdzy , Bruce Sagan

We investigate the asymptotic behavior, as $N$ grows, of the largest minimal pairwise distance of $N$ points restricted to an arbitrary compact rectifiable set embedded in Euclidean space, and we find the limit distribution of such optimal…

Mathematical Physics · Physics 2007-05-23 S. V. Borodachov , D. P. Hardin , E. B. Saff

We analyze the asymptotic convergence of all infinite products of matrices taken in a given finite set, by looking only at finite or periodic products. It is known that when the matrices of the set have a common nonincreasing polyhedral…

Discrete Mathematics · Computer Science 2016-10-14 Pierre-Yves Chevalier , Julien M. Hendrickx , Raphaël M. Jungers

We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…

Rings and Algebras · Mathematics 2010-06-24 Stijn Vermeeren

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…

Combinatorics · Mathematics 2024-11-12 Ginji Hamano , Ichiro Sainose , Takayuki Hibi

We prove that there is an absolute constant $c > 0$ such that for every $$a_0,a_1, \ldots,a_n \in [1,M]\,, \qquad 1 \leq M \leq \frac 14 \exp \left( \frac n9 \right)\,,$$ there are $$b_0,b_1,\ldots,b_n \in \{-1,0,1\}$$ such that the…

Number Theory · Mathematics 2024-10-17 Tamás Erdélyi

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

Combinatorics · Mathematics 2012-02-14 M. H. Albert , Micah Coleman , Ryan Flynn , Imre Leader

Let X_n=(x_{ij}) be an n by p data matrix, where the n rows form a random sample of size n from a certain p-dimensional population distribution. Let R_n=(\rho_{ij}) be the p\times p sample correlation matrix of X_n; that is, the entry…

Probability · Mathematics 2009-09-29 Tiefeng Jiang

We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive…

Number Theory · Mathematics 2025-04-22 Andrew Lott , Ákos Magyar , Giorgis Petridis , János Pintz

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the…

Computational Geometry · Computer Science 2015-05-14 Herbert Edelsbrunner , Mabel Iglesias-Ham , Vitaliy Kurlin