English
Related papers

Related papers: On an extremal problem for poset dimension

200 papers

We study the diametric problem (i.e., optimal anticodes) in the space of permutations under the Ulam distance. That is, let $S_n$ denote the set of permutations on $n$ symbols, and for each $\sigma, \tau \in S_n$, define their Ulam distance…

Combinatorics · Mathematics 2024-03-05 Pat Devlin , Leo Douhovnikoff

The Frobenius number F(a) of an integer vector a with positive coprime coefficients is defined as the largest number that does not have a representation as a positive integer linear combination of the coefficients of a. We show that if a is…

Number Theory · Mathematics 2015-09-07 Jens Marklof

The authors have recently obtained a lower bound of the Hausdorff dimension of the sets of vectors $(x_1, \ldots, x_d)\in [0,1)^d$ with large Weyl sums, namely of vectors for which $$ \left| \sum_{n=1}^{N}\exp(2\pi i (x_1 n+\ldots +x_d…

Classical Analysis and ODEs · Mathematics 2019-07-10 Changhao Chen , Igor E. Shparlinski

We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…

Combinatorics · Mathematics 2017-03-22 Michael Engen , Vincent Vatter

In this paper we prove the Hausdorff dimension of the set of (nondegenerate) singular two-dimensional vectors with uniform exponent $\mu$ $\in$ (1/2, 1) is 2(1 -- $\mu$) when $\mu$ $\ge$ $\sqrt$ 2/2, whereas for $\mu$ \textless{} $\sqrt$…

Number Theory · Mathematics 2019-08-15 Yann Bugeaud , Yitwah Cheung , Nicolas Chevallier

A subset $S$ of real numbers is called bi-Sidon if it is a Sidon set with respect to both addition and multiplication, i.e., if all pairwise sums and all pairwise products of elements of $S$ are distinct. Imre Ruzsa asked the following…

Combinatorics · Mathematics 2024-09-16 János Pach , Dmitrii Zakharov

We fix a maximal order $\mathcal O$ in $\F=\R,\C$ or $\mathbb{H}$, and an $\F$-hermitian form $Q$ of signature $(n,1)$ with coefficients in $\mathcal O$. Let $k\in\N$. By applying a lattice point theorem on the $\F$-hyperbolic space, we…

Number Theory · Mathematics 2014-01-03 Emilio A. Lauret

A poset $\bfp$ is well-partially ordered (WPO) if all its linear extensions are well orders~; the supremum of ordered types of these linear extensions is the {\em length}, $\ell(\bfp)$ of $\bfp$. We prove that if the vertex set $X$ of…

Logic · Mathematics 2015-10-05 Christian Delhommé , Maurice Pouzet

Given a vector $\alpha = (\alpha_1, \ldots, \alpha_k) \in \mathbb{F}_2^k$, we say a collection of subsets $\mathcal{F}$ satisfies $\alpha$-intersection pattern modulo $2$ if all $i$-wise intersections consisting of $i$ distinct sets from…

Combinatorics · Mathematics 2025-03-27 Griffin Johnston , Jason O'Neill

Fix a density d in (0,1], and let F_p^n be a finite field, where we think of p fixed and n tending to infinity. Let S be any subset of F_p^n having the minimal number of three-term progressions, subject to the constraint |S| is at least…

Number Theory · Mathematics 2007-05-23 Ernie Croot

Let M be a subset of {0, .., n} and F be a family of subsets of an n element set such that the size of A intersection B is in M for every A, B in F. Suppose that l is the maximum number of consecutive integers contained in M and n is…

Combinatorics · Mathematics 2012-05-04 Dhruv Mubayi , Vojtech Rodl

We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…

Combinatorics · Mathematics 2023-11-14 Grégory Chatel , Vincent Pilaud , Viviane Pons

Given a function $f$ on $\mathbb{F}_2^n$, we study the following problem. What is the largest affine subspace $\mathcal{U}$ such that when restricted to $\mathcal{U}$, all the non-trivial Fourier coefficients of $f$ are very small? For the…

Computational Complexity · Computer Science 2023-05-04 Siddharth Iyer , Michael Whitmeyer

What is the maximum number of holes enclosed by a $d$-dimensional polyomino built of $n$ tiles? Represent this number by $f_d(n)$. Recent results show that $f_2(n)/n$ converges to $1/2$. We prove that for all $d \geq 2$ we have $f_d(n)/n…

Combinatorics · Mathematics 2022-08-01 Greg Malen , Fedor Manin , Erika Roldan

We prove that every planar poset $P$ of height $h$ has dimension at most $192h + 96$. This improves on previous exponential bounds and is best possible up to a constant factor. We complement this result with a construction of planar posets…

Combinatorics · Mathematics 2018-01-11 Gwenaël Joret , Piotr Micek , Veit Wiechert

Given two phylogenetic trees with the $\{1, \ldots, n\}$ leaf-set the maximum agreement subtree problem asks what is the maximum size of the subset $A \subseteq \{1, \ldots, n\}$ such that the two trees are equivalent when restricted to…

Combinatorics · Mathematics 2018-12-18 Alexey Markin

We obtain a new lower bound on the largest Sidon subset of an arbitrary finite set of integers. If $H(n)$ denotes the minimum, over all $n$-element subsets of $\mathbb Z$, of the largest Sidon subset they contain, we prove that $H(n)…

Combinatorics · Mathematics 2026-05-06 Alexandre Bailleul , Robin Riblet

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

Classical Analysis and ODEs · Mathematics 2024-09-23 Jonathan M. Fraser

Let $F$ be a fixed field of characteristic zero containing an element $i$ such that $i^2 = -1$. In this paper we consider finite dimensional superalgebras over $F$ endowed with a pseudoautomorphism $p$ and we investigate the asymptotic…

Rings and Algebras · Mathematics 2025-08-28 Elena Campedel , Ginevra Giordani , Antonio Ioppolo

For a family $\mathcal{F}$ of subsets of [n]=\{1, 2, ..., n} ordered by inclusion, and a partially ordered set P, we say that $\mathcal{F}$ is P-free if it does not contain a subposet isomorphic to P. Let $ex(n, P)$ be the largest size of a…

Combinatorics · Mathematics 2016-05-24 Maria Axenovich , Jacob Manske , Ryan R. Martin