English
Related papers

Related papers: Numerical semigroups, polyhedra, and posets III: m…

200 papers

We contruct a one-to-one correspondence between a subset of numerical semigroups with genus $g$ and $\gamma$ even gaps and the integer points of a rational polytope. In particular, we give an overview to apply this correspondence to try to…

Combinatorics · Mathematics 2020-06-30 Matheus Bernardini

For a numerical semigroup $S := \langle n_1, \dots, n_k \rangle$ with minimal generators $n_1 < \cdots < n_k$, Barron, O'Neill, and Pelayo showed that $L(s+n_1) = L(s) + 1$ and $\ell(s+n_k) = \ell(s) + 1$ for all sufficiently large $s \in…

Commutative Algebra · Mathematics 2023-08-23 Baian Liu

We study the poset of normalized ideals of a numerical semigroup with multiplicity three. We show that this poset is always a lattice, and that two different numerical semigroups with multiplicity three have non-isomorphic posets of…

Commutative Algebra · Mathematics 2024-08-01 S. Bonzio , P. A. García-Sánchez

We use representations and differentiation algorithms of posets, in order to obtain results concerning unsolved problems on figurate numbers. In particular, we present criteria for natural numbers which are the sum of three octahedral…

Number Theory · Mathematics 2008-06-17 Agustin Moreno C

Understanding the face structure of the balanced minimal evolution (BME) polytope, especially its top-dimensional facets, is crucially important to phylogenetic applications. We show that BME polytope has a sub-lattice of its poset of faces…

Combinatorics · Mathematics 2021-04-09 Stefan Forcey , Logan Keefe , William Sands

We develop a geometric procedure for finding the Ap\'ery set of any numerical semigroup with embedding dimension four. Previous methods of comparable strength worked only for embedding dimension three or under very specific conditions. We…

Number Theory · Mathematics 2026-05-27 Kazimierz Chomicz

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

Computational Geometry · Computer Science 2013-07-30 David Eppstein , Maarten Löffler

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

Metric Geometry · Mathematics 2017-03-23 Vera Roshchina , Tian Sang , David Yost

Different commutative semigroups may have a common saturation. We consider distinguishing semigroups with a common saturation based on their ``sparsity''. We propose to qualitatively describe sparsity of a semigroup by considering which…

Combinatorics · Mathematics 2008-06-02 Akimichi Takemura , Ruriko Yoshida

Motivated by the work of Panina and her coauthors on cyclopermutohedron we study a poset whose elements correspond to equivalence classes of partitions of the set $\{1,\cdots, n+1\}$ up to cyclic permutations and orientation reversion. This…

Algebraic Topology · Mathematics 2019-04-30 Priyavrat Deshpande , Naageswaran Manikandan , Anurag Singh

We introduce the subsemigroup complex of a finite semigroup S as a (boolean representable) simplicial complex defined through chains in the lattice of subsemigroups of S. We present a research program for such complexes, illustrated through…

Combinatorics · Mathematics 2017-05-16 Stuart Margolis , John Rhodes , Pedro V. Silva

A nilpotent endomorphism of a quiver representation induces a linear transformation on the vector space at each vertex. Generically among all nilpotent endomorphisms, there is a well-defined Jordan form for these linear transformations,…

Representation Theory · Mathematics 2022-12-15 Alexander Garver , Rebecca Patrias , Hugh Thomas

A poset $(P',\le_{P'})$ contains a copy of some other poset $(P,\le_P)$ if there is an injection $f\colon P'\to P$ where for every $X,Y\in P$, $X\le_P Y$ if and only if $f(X)\le_{P'} f(Y)$. For any posets $P$ and $Q$, the poset Ramsey…

Combinatorics · Mathematics 2022-04-08 Christian Winter

In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…

Combinatorics · Mathematics 2018-08-14 Victor Reiner , Bridget Eileen Tenner , Alexander Yong

Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…

Combinatorics · Mathematics 2013-01-22 Abdallah Assi , Pedro A. García-Sánchez

It is shown that the Cuntz semigroup of a space with dimension at most two, and with second cohomology of its compact subsets equal to zero, is isomorphic to the ordered semigroup of lower semicontinuous functions on the space with values…

Operator Algebras · Mathematics 2013-09-04 Leonel Robert

We investigate a poset structure that extends the weak order on a finite Coxeter group $W$ to the set of all faces of the permutahedron of $W$. We call this order the facial weak order. We first provide two alternative characterizations of…

Combinatorics · Mathematics 2023-11-14 Aram Dermenjian , Christophe Hohlweg , Vincent Pilaud

Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are parametrized by the convex body of…

Algebraic Geometry · Mathematics 2018-05-03 Lynn Chua , Daniel Plaumann , Rainer Sinn , Cynthia Vinzant

We consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset $P$ and an integer $m$ greater than the cardinality of the largest antichain in $P$, what is the minimum number of…

Combinatorics · Mathematics 2017-08-29 Jonathan A. Noel , Alex Scott , Benny Sudakov

In this article we introduce the $m$-cover poset of an arbitrary bounded poset $\mathcal{P}$, which is a certain subposet of the $m$-fold direct product of $\mathcal{P}$ with itself. Its ground set consists of multichains of $\mathcal{P}$…

Combinatorics · Mathematics 2016-07-27 Myrto Kallipoliti , Henri Mühle