English
Related papers

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

200 papers

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…

Optimization and Control · Mathematics 2011-03-28 Gennadiy Averkov , Christian Wagner , Robert Weismantel

The cross--product conjecture (CPC) of Brightwell, Felsner and Trotter (1995) is a two-parameter quadratic inequality for the number of linear extensions of a poset $P= (X, \prec)$ with given value differences on three distinct elements in…

Combinatorics · Mathematics 2022-12-05 Swee Hong Chan , Igor Pak , Greta Panova

Let $\mathfrak{P}_r$ be a representation system of the non-isomorphic finite posets, and let ${\cal H}(P,Q)$ be the set of order homomorphisms from $P$ to $Q$. For finite posets $R$ and $S$, we write $R \sqsubseteq_G S$ iff, for every $P…

Combinatorics · Mathematics 2019-08-20 Frank a Campo

Deep state-space models (SSMs) have gained increasing popularity in sequence modelling. While there are numerous theoretical investigations of shallow SSMs, how the depth of the SSM affects its expressiveness remains a crucial problem. In…

Machine Learning · Computer Science 2025-06-25 Zeyu Bao , Penghao Yu , Haotian Jiang , Qianxiao Li

In this paper we introduce a problem that bridges forbidden subposet and forbidden subconfiguration problems. The sets $F_1,F_2, \dots,F_{|P|}$ form a copy of a poset $P$, if there exists a bijection $i:P\rightarrow \{F_1,F_2,…

Combinatorics · Mathematics 2017-06-06 Dániel Gerbner , Balázs Patkós , Máté Vizer

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

Given a set of squares and a strip of bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are…

Discrete Mathematics · Computer Science 2023-07-14 Wei Wu , Hiroki Numaguchi , Yannan Hu , Mutsunori Yagiura

We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the…

Symbolic Computation · Computer Science 2010-11-24 Xavier Dahan , Abdulilah Kadri , Éric Schost

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

Representation Theory · Mathematics 2026-02-02 Henning Krause , Balduin Stoye

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

Combinatorics · Mathematics 2008-04-09 Andrey Radoslavov Antonov , Sascha Kurz

The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…

Combinatorics · Mathematics 2025-03-25 Ivan Chajda , Helmut Länger

This paper investigates pattern avoidance in linear extensions of a certain class of partially ordered set. Since the question of enumerating pattern avoiding linear extensions of posets in general is a very hard one, we focus instead on…

Combinatorics · Mathematics 2014-12-23 Sophia Yakoubov

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

Combinatorics · Mathematics 2017-05-04 Oliver Roche-Newton , Ilya D. Shkredov , Arne Winterhof

We study the representation dimension of the class of algebras known as quantum complete intersections. For such an algebra, we show that the representation dimension is at most twice its codimension. Moreover, we show that the…

Quantum Algebra · Mathematics 2007-10-16 Petter Andreas Bergh , Steffen Oppermann

We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Ne\v{s}et\v{r}il and Ossona de Mendez as a model for sparsity in graphs, is a…

Combinatorics · Mathematics 2019-02-11 Gwenaël Joret , Piotr Micek , Veit Wiechert

In this short paper, we prove the following generalization of a result of Methuku and P\'{a}lv\"{o}lgyi. Let $P$ be a poset, then there exists a constant $C_{P}$ with the following property. Let $k$ and $n$ be arbitrary positive integers…

Combinatorics · Mathematics 2017-06-02 István Tomon

We introduce a new invariant for triangulated categories: the poset of spherical subcategories ordered by inclusion. This yields several numerical invariants, like the cardinality and the height of the poset. We explicitly describe…

Representation Theory · Mathematics 2019-04-23 Andreas Hochenegger , Martin Kalck , David Ploog

This paper is the third in a series of manuscripts that examine the combinatorics of the Kunz polyhedron $P_m$, whose positive integer points are in bijection with numerical semigroups (cofinite subsemigroups of $\mathbb Z_{\ge 0}$) whose…

Combinatorics · Mathematics 2023-05-09 Tara Gomes , Christopher O'Neill , Eduardo Torres Davila

It is a well-known fact that although the poset of open sets of a topological space is a Heyting algebra, its Heyting implication is not necessarily stable under the inverse image of continuous functions and hence is not a geometric…

Logic · Mathematics 2024-05-09 Amirhossein Akbar Tabatabai

The weak Bruhat order on $ { \mathcal S }_n $ is the partial order $\prec$ so that $\sigma \prec \tau$ whenever the set of inversions of $\sigma$ is a subset of the set of inversions of $\tau$. We investigate the time complexity of…

Combinatorics · Mathematics 2015-07-03 Joshua Cooper , Anna Kirkpatrick