English
Related papers

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

200 papers

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

Combinatorics · Mathematics 2025-04-15 Christoph Minz

Motivated by the authors' work on permuto-associahedra, which can be considered as a symmetrization of the associahedron using the symmetric group, we introduce and study the $\mathfrak{G}$-symmetrization of an arbitrary polytope $P$ for…

Combinatorics · Mathematics 2024-08-07 Federico Castillo , Fu Liu

Kohnert polynomials and their associated posets are combinatorial objects with deep geometric and representation theoretic connections, generalizing both Schubert polynomials and type A Demazure characters. In this paper, we explore the…

Fixed two positive integers m and e, some algorithms for computing the minimal Frobenius number and minimal genus of the set of numerical semigroups with multiplicity m and embedding dimension e are provided. Besides, the semigroups where…

Commutative Algebra · Mathematics 2017-12-15 J. I. García-García , D. Marín-Aragón , M. A. Moreno-Frías , J. C. Rosales , A. Vigneron-Tenorio

The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…

Combinatorics · Mathematics 2016-07-26 João Gouveia , Kanstanstin Pashkovich , Richard Z. Robinson , Rekha R. Thomas

Let $P$ be a finite partially ordered set. In a recent series of works, Proudfoot introduced the notion of $Z$-polynomials associated with $P$-kernels, providing a unified framework for various intersection cohomology Poincar\'e polynomials…

Combinatorics · Mathematics 2025-10-21 Luis Ferroni , Roberto Riccardi

This paper is concerned with algorithms and applications of decreasing minimization on an M-convex set, which is the set of integral elements of an integral base-polyhedron. Based on a recent characterization of decreasingly minimal…

Combinatorics · Mathematics 2021-07-19 András Frank , Kazuo Murota

Given a set S of n points in general position, we consider all k-th order Voronoi diagrams on S, for k=1,...,n, simultaneously. We deduce symmetry relations for the number of faces, number of vertices and number of circles of certain…

Metric Geometry · Mathematics 2007-05-23 Roderik C. Lindenbergh

For a finite volume geodesic polyhedron P in hyperbolic 3-space, with the property that all interior angles between incident faces are integral submultiples of Pi, there is a naturally associated Coxeter group generated by reflections in…

K-Theory and Homology · Mathematics 2017-05-24 J. -F. Lafont , B. A. Magurn , I. J. Ortiz

In this paper, we study the simplex faces of the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a finite poset $P$. We show that, if $P$ can be recursively constructed from $\mathbf{X}$-free posets using disjoint…

Combinatorics · Mathematics 2025-11-06 Ragnar Freij-Hollanti , Teemu Lundström

We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that…

Combinatorics · Mathematics 2017-03-31 Raman Sanyal , Christian Stump

We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann , Michael Joswig , Marc E. Pfetsch

The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…

Representation Theory · Mathematics 2019-02-27 Vyacheslav Futorny , Kostiantyn Iusenko

A classic problem in matroid theory is to find subspace arrangements, specifically hyperplane and pseudosphere arrangements, whose intersection posets are isomorphic to a prescribed geometric lattice. Engstr\"om recently showed how to…

Combinatorics · Mathematics 2019-09-04 Steven Klee , Matthew T. Stamps

Let $[a,b]$ denote the integers between $a$ and $b$ inclusive and, for a finite subset $X \subseteq \mathbb{Z}$, let the diameter of $X$ be equal to $\max(X)-\min(X)$. We write $X<_p\,Y$ provided $\max(X)<\min(Y)$. For a positive integer…

Combinatorics · Mathematics 2014-07-22 Daniel Bernstein , David J. Grynkiewicz , Carl R. Yerger

This paper studies Young diagrams of symmetric and pseudo-symmetric numerical semigroups and describes new operations on Young diagrams as well as numerical semigroups. These provide new decompositions of symmetric and pseudo-symmetric…

Group Theory · Mathematics 2020-11-18 Meral Süer , Mehmet Yeşil

This paper extends our earlier work where we constructed ``minuscule'' representations of Kac--Moody algebras from colored posets in a way that maintains key properties of the well-known minuscule representations of simple Lie algebras. In…

Combinatorics · Mathematics 2025-06-17 Michael C. Strayer

Let $S\_{N}(P)$ be the poset obtained by adding a dummy vertex on each diagonal edge of the $N$'s of a finite poset $P$. We show that $S\_{N}(S\_{N}(P))$ is $N$-free. It follows that this poset is the smallest $N$-free barycentric…

Discrete Mathematics · Computer Science 2007-05-23 Maurice Pouzet , Nejib Zaguia

Let $\mathcal{C}$ be a positive integer cone and $k\in \mathcal{C}$. A $\mathcal{C}$-semigroup $S$ is $k$-positioned if for every $h\in \mathcal{C}\setminus S$ we have that $k-h$ belongs to $S$. In this work, we focus on this family of…

Combinatorics · Mathematics 2026-01-28 Carmelo Cisto , Raquel Tapia-Ramos

We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with $15-30$ edges, including $K_8$, $K_{3,3,3}$, $K_{1,4,4}$, $K_{5,5}$, some other $K_{l,m}$, $K_{1,l,m}$, $Prism_7,…

Combinatorics · Mathematics 2015-05-15 Michel Deza , Mathieu Dutour Sikiric
‹ Prev 1 4 5 6 7 8 10 Next ›