English
Related papers

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

200 papers

Let $\mathcal{P}$ be a partition of a finite set $X$. We say that a full transformation $f:X\to X$ preserves (or stabilizes) the partition $\mathcal{P}$ if for all $P\in \mathcal{P}$ there exists $Q\in \mathcal{P}$ such that $Pf\subseteq…

Group Theory · Mathematics 2015-08-05 Joao Araujo , Wolfram Bentz , J. D. Mitchell , Csaba Schneider

Because of the importance of unitarity in quantum physics, work on the representations of the de Sitter group has focussed on the unitary case, which necessarily means infinite dimensional matrices for this non-compact group. Here we…

Group Theory · Mathematics 2025-06-23 Richard A. W. Bradford

We introduce a method that produces a bijection between the posets ${\rm silt-}{A}$ and ${\rm silt-}{B}$ formed by the isomorphism classes of basic silting complexes over finite-dimensional $k$-algebras $A$ and $B$, by lifting $A$ and $B$…

Representation Theory · Mathematics 2021-01-20 Florian Eisele

We study lowest-weight irreducible representations of rational Cherednik algebras attached to the complex reflection groups G(m,r,n) in characteristic p. Our approach is mostly from the perspective of commutative algebra. By studying the…

Representation Theory · Mathematics 2015-01-08 Sheela Devadas , Steven V Sam

The left regular band structure on a hyperplane arrangement and its representation theory provide an important connection between semigroup theory and algebraic combinatorics. A finite semigroup embeds in a real hyperplane face monoid if…

Group Theory · Mathematics 2013-01-01 Stuart Margolis , Franco Saliola , Benjamin Steinberg

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

Combinatorics · Mathematics 2018-09-27 Calvin Leng , Christopher O'Neill

We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…

Combinatorics · Mathematics 2018-02-06 Frank A Campo , Marcel Erné

Thanks to recent advances in parametric geometry of numbers, we know that the spectrum of any set of $m$ exponents of Diophantine approximation to points in $\mathbb{R}^n$ (in a general abstract setting) is a compact connected subset of…

Number Theory · Mathematics 2022-02-02 Martin Rivard-Cooke , Damien Roy

We introduce partially ordered sets (posets) with an additional structure given by a collection of vector subspaces of an algebra $A$. We call them algebraically equipped posets. Some particular cases of these, are generalized equipped…

Representation Theory · Mathematics 2015-01-14 Raymundo Bautista , Ivon Dorado

We consider semigroups $\{\alpha_t: \; t\geq 0\}$ of normal, unital, completely positive maps $\alpha_t$ on a von Neumann algebra ${\mathcal M}$. The (predual) semigroup $\nu_t (\rho):= \rho \circ \alpha_t$ on normal states $\rho$ of…

Mathematical Physics · Physics 2017-08-23 Guido A. Raggio , Pablo R. Zangara

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…

Geometric Topology · Mathematics 2018-11-14 Joseph Gordon , Gaiane Panina

We study a family of posets and the associated chain and order polytopes. We identify the order polytope as a maximal Kogan face in a Gelfand-Tsetlin polytope of a multiple of a fundamental weight. We show that the character of such a Kogan…

Representation Theory · Mathematics 2015-07-07 Rekha Biswal , Ghislain Fourier

The way to arrive at formula of zeta matrix for any graded posets with the finite set of minimal elements is delivered following the first reference. This is being achieved via adjacency and zeta matrix description of bipartite digraphs…

Combinatorics · Mathematics 2011-05-19 A. K. Kwasniewski

We prove that the 18-element non-lattice orthomodular poset depicted in the paper is the smallest one and unique up to isomorphism. Since not every Boolean poset is orthomodular, we consider the class of the so-called generalized…

Quantum Algebra · Mathematics 2022-10-12 Ivan Chajda , Miroslav Kolařík , Helmut Länger

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…

Combinatorics · Mathematics 2026-02-05 Gi-Sang Cheon , Hong Joon Choi , Gukwon Kwon , Hojoon Lee , Yaling Wang

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

Combinatorics · Mathematics 2025-05-06 Carmelo Cisto , Gioia Failla , Francesco Navarra

A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…

Commutative Algebra · Mathematics 2026-02-03 Pedro Garcia-Sanchez , Christopher O'Neill

Given an integral $d \times n$ matrix $A$, the well-studied affine semigroup $\mbox{ Sg} (A)=\{ b : Ax=b, \ x \in {\mathbb Z}^n, x \geq 0\}$ can be stratified by the number of lattice points inside the parametric polyhedra $P_A(b)=\{x:…

Combinatorics · Mathematics 2015-07-27 Iskander Aliev , Jesus A. De Loera , Quentin Louveaux

The aim of this article is to study the ideal class monoid $\mathcal{C}\ell(S)$ of a numerical semigroup $S$ introduced by V. Barucci and F. Khouja. We prove new bounds on the cardinality of $\mathcal{C}\ell(S)$. We observe that…

Commutative Algebra · Mathematics 2023-02-23 Laura Casabella , Marco D'Anna , Pedro A. García-Sánchez

We study properties of semi-elementary imsets and elementary imsets introduced by Studeny (2005). The rules of the semi-graphoid axiom (decomposition, weak union and contraction) for conditional independence statements can be translated…

Statistics Theory · Mathematics 2011-08-22 Takuya Kashimura , Tomonari Sei , Akimichi Takemura , Kentaro Tanaka