English
Related papers

Related papers: On combinatorial problem concerning partitions of …

200 papers

A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ where $i<j$. In…

Combinatorics · Mathematics 2007-06-12 Geir Agnarsson

We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…

Computational Geometry · Computer Science 2025-09-15 Jaehoon Chung , Kazuo Iwama , Chung-Shou Liao , Hee-Kap Ahn

We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both pP(n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where pP(n) is the number…

Combinatorics · Mathematics 2007-05-23 George E. Andrews , Arnold Knopfmacher , Burkhard Zimmermann

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

Computational Complexity · Computer Science 2024-12-20 Mario Ullrich , Jan Vybíral

In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…

Combinatorics · Mathematics 2024-12-31 Shoichi Kamada

We perform a systematic investigation of Kazhdan's relative Property (T) for pairs (G,X), where G a locally compact group and X is any subset. When G is a connected Lie group or a p-adic algebraic group, we provide an explicit…

Group Theory · Mathematics 2010-08-04 Yves de Cornulier

The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through…

Combinatorics · Mathematics 2020-09-03 Thomas Grubb , Frederick Rajasekaran

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…

Logic · Mathematics 2008-02-03 Thomas Jech , Saharon Shelah

The classical Busemann-Petty problem (1956) asks, whether origin-symmetric convex bodies in $\mathbb {R}^n$ with smaller hyperplane central sections necessarily have smaller volumes. It is known, that the answer is affirmative if $n\le 4$…

Functional Analysis · Mathematics 2009-03-30 Boris Rubin

Using the theory of resolving classes, we show that if $X$ is a CW complex of finite type such that $\map_*(X, S^{2n+1})\sim *$ for all sufficiently large $n$, then $\map_*(X, K) \sim *$ for every simply-connected finite-dimensional CW…

Algebraic Topology · Mathematics 2012-05-04 Jeffrey Strom

Let W_n(K) be the Lie algebra of derivations of the polynomial algebra K[X]:=K[x_1,...,x_n] over an algebraically closed field K of characteristic zero. A subalgebra L of W_n(K) is called polynomial if it is a submodule of the K[X]-module…

Rings and Algebras · Mathematics 2012-01-04 I. V. Arzhantsev , E. A. Makedonskii , A. P. Petravchuk

If $a_1, a_2, ..., a_k$ and $n$ are positive integers such that $n = a_1 + a_2 + ... + a_k$, then the sum $a_1 + a_2 + ... + a_k$ is said to be a \emph{partition of $n$} of \emph{length $k$}, and $a_1, a_2, ..., a_k$ are said to be the…

Combinatorics · Mathematics 2013-04-25 Peter Borg

We show that if A is a large subset of a box in Z^d with dimensions L_1 >= L_2 >= ... >= L_d which are all reasonably large, then |A + A| > 2^{d/48}|A|. By combining this with Chang's quantitative version of Freiman's theorem, we prove a…

Number Theory · Mathematics 2007-05-23 Ben Green

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

Algebraic Geometry · Mathematics 2011-11-10 J. Maurice Rojas

Let A and M be nonempty sets of positive integers. A partition of the positive integer n with parts in A and multiplicities in M is a representation of n in the form n = \sum_{a\in A} m_a a, where m_a is in M U {0} for all a in A, and m_a…

Number Theory · Mathematics 2013-04-15 Zeljka Ljujic , Melvyn B. Nathanson

We investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age…

Logic · Mathematics 2014-01-14 C. Laflamme , L. Nguyen Van The , M. Pouzet , N. Sauer

For every integer $n$ with $n \geq 6$, we prove that the Boolean dimension of a poset consisting of all the subsets of $\{1,\dots,n\}$ equipped with the inclusion relation is strictly less than $n$.

Combinatorics · Mathematics 2025-03-13 Marcin Briański , Jędrzej Hodor , Hoang La , Piotr Micek , Katzper Michno

It is known that there are many notions of largeness in a semigroup that own rich combinatorial properties. In this paper, we focus on partition and almost disjoint properties of these notions. One of the most remarkable results with…

Combinatorics · Mathematics 2025-01-22 Teng Zhang

A $(k,\ell )$ partial partition of an $n$-element set is a collection of $\ell $ pairwise disjoint $k$-element subsets. It is proved that, if $n$ is large enough, one can find $\left\lfloor {n\choose k}/{\ell}\right\rfloor$ such partial…

Combinatorics · Mathematics 2023-12-15 Gyula O. H. Katona , Gyula Y. Katona

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of…

Combinatorics · Mathematics 2016-06-06 Freddie Manners