English
Related papers

Related papers: Cube Height, Cube Width and Related Extremal Probl…

200 papers

Extending results of Linial (1984) and Aigner (1985), we prove a uniform lower bound on the balance constant of a poset $P$ of width $2$. This constant is defined as $\delta(P) = \max_{(x, y)\in P^2}\min\{\mathbb{P}(x\prec y),…

Combinatorics · Mathematics 2021-06-21 Ashwin Sah

The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for…

Combinatorics · Mathematics 2018-02-20 Samuel Dittmer , Igor Pak

The maximum size, $La(n,P)$, of a family of subsets of $[n]=\{1,2,...,n\}$ without containing a copy of $P$ as a subposet, has been intensively studied. Let $P$ be a graded poset. We say that a family $\mathcal{F}$ of subsets of…

Combinatorics · Mathematics 2017-10-26 Dániel Gerbner , Abhishek Methuku , Dániel T. Nagy , Balázs Patkós , Máté Vizer

In this paper we are interested in the following problem. Let $p$ be a prime number, $S\subset \F_p$ and $\cP\subset \{P\in\F_p [X]:\deg P\le d\}$. What is the largest integer $k$ such that for all subsets $\cA, \cB$ of $\F_p$ satisfying…

Number Theory · Mathematics 2013-02-20 Ramachandran Balasubramanian , Cécile Dartyge , Elie Mosaki

In general, representations of interval orders may use an arbitrary set of interval lengths. We can define subclasses of interval orders by restricting the allowable lengths of intervals. Motivated by a recent paper of Keller, Trenk, and…

Combinatorics · Mathematics 2024-11-13 Csaba Biro , Sida Wan

We consider the problem of determining the maximum number of pairs $F\subseteq F'$ in a family $\mathcal{F}\subseteq 2^{[n]}$ that avoids certain posets $P$ of height 2. We show that for any such $P$ the number of pairs is…

Combinatorics · Mathematics 2021-11-17 Dániel Nagy , Balázs Patkós

A convex cone is said to be projectionally exposed (p-exposed) if every face arises as a projection of the original cone. It is known that, in dimension at most four, the intersection of two p-exposed cones is again p-exposed. In this paper…

Optimization and Control · Mathematics 2025-01-23 Bruno F. Lourenço , Vera Roshchina , James Saunderson

Let $P_n$ be a Sylow $p$-subgroup of the symmetric group $S_n$. We investigate the number and sizes of the $P_n\setminus S_n\ /\ P_n$ double cosets, showing that most double cosets have maximal size when $p$ is odd, or equivalently, that…

Consider the classical $(2+1)$-dimensional Solid-On-Solid model above a hard wall on an $L\times L$ box of $\bbZ^2$. The model describes a crystal surface by assigning a non-negative integer height $\eta_x$ to each site $x$ in the box and 0…

Probability · Mathematics 2013-02-28 Pietro Caputo , Eyal Lubetzky , Fabio Martinelli , Allan Sly , Fabio Lucio Toninelli

In a projective plane $\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\mathcal{S}$ is saturating (or dense) if any point of $\Pi_{q}\setminus \mathcal{S}$ is collinear with two points in $\mathcal{S}$. Modifying an…

Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of…

Combinatorics · Mathematics 2024-03-18 Kada Williams

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

The Wythoff construction takes a $d$-dimensional polytope $P$, a subset $S$ of $\{0,..., d\}$ and returns another $d$-dimensional polytope $P(S)$. If $P$ is a regular polytope, then $P(S)$ is vertex-transitive. This construction builds a…

Combinatorics · Mathematics 2008-08-11 Michel Deza , Mathieu Dutour , Sergey Shpectorov

The canonical dimension is an invariant attached to admissible representations of p-adic reductive groups, which has only received significant attention in the case of mod-p representations. In the case of complex representations, the…

Representation Theory · Mathematics 2025-09-30 Mick Gielen

A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals…

Logic · Mathematics 2016-08-31 Rob Egrot

Partial Set Cover (PSC) is a generalization of the well-studied Set Cover problem (SC). In PSC the input consists of an integer $k$ and a set system $(U,S)$ where $U$ is a finite set, and $S \subseteq 2^U$ is a collection of subsets of $U$.…

Data Structures and Algorithms · Computer Science 2019-07-11 Chandra Chekuri , Kent Quanrud , Zhao Zhang

We consider tilings and packings of $\RR^d$ by integral translates of cubes $[0,2[^d$, which are $4\ZZ^d$-periodic. Such cube packings can be described by cliques of an associated graph, which allow us to classify them in dimension $d\leq…

Combinatorics · Mathematics 2007-05-23 Mathieu Dutour , Yoshiaki Itoh , Alexei Poyarkov

We introduce two variants of the poset saturation problem. For a poset $P$ and the Boolean lattice $\mathcal{B}_n$, a family $\mathcal{F}$ of sets, not necessarily from $\mathcal{B}_n$, is \textit{projective $P$-saturated} if (i) it does…

Combinatorics · Mathematics 2023-06-21 Dömötör Pálvölgyi , Balázs Patkós

We consider representations of general non-overlapping placements of rectangles by spatial relations (west, south, east, north) of pairs of rectangles. We call a set of representations complete if it contains a representation of every…

Combinatorics · Mathematics 2017-09-01 Jannik Silvanus , Jens Vygen

A skew Bollob\'{a}s system $\mathcal{P}=\{(A_i,B_i):1\leq i\leq m\}$ is a collection of pairs of disjoint subsets of $[n]$ such that $A_i\cap B_j\ne\emptyset$ for any $1\leq i<j\leq m$. Denote by $S_1(a, b)$ or $S_2(a, b)$ the maximum size…

Combinatorics · Mathematics 2026-05-01 Yu Fang , Tao Feng , Xiaomiao Wang