English
Related papers

Related papers: A Poset Structure on the Alternating Group Generat…

200 papers

We introduce iposets---posets with interfaces---equipped with a novel gluing composition along interfaces and the standard parallel composition. We study their basic algebraic properties as well as the hierarchy of gluing-parallel posets…

Formal Languages and Automata Theory · Computer Science 2019-10-15 Uli Fahrenberg , Christian Johansen , Georg Struth , Ratan Bahadur Thapa

We investigate a higher-group structure of massless axion electrodynamics in $(3+1)$ dimensions. By using the background gauging method, we show that the higher-form symmetries necessarily have a global semistrict 3-group (2-crossed module)…

High Energy Physics - Theory · Physics 2021-02-10 Yoshimasa Hidaka , Muneto Nitta , Ryo Yokokura

We introduce a new class of reflection groups associated with the canonical bilinear lattices of Lenzing, which we call reflection groups of canonical type. The main result of this work is a categorification of the corresponding poset of…

Representation Theory · Mathematics 2025-12-02 Barbara Baumeister , Igor Burban , Georges Neaime , Charly Schwabe

We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.

Combinatorics · Mathematics 2009-03-30 David Bessis , Victor Reiner

The lattice of intersections of reflecting hyperplanes of a complex reflection group W may be considered as the poset of 1-eigenspaces of the elements of W. In this paper we replace 1 with an arbitrary eigenvalue and study the topology and…

Combinatorics · Mathematics 2012-08-10 Alexander R. Miller

This paper presents combinatorial facts dealing with the number of unlabeled partially ordered sets (posets) refined by the number of arcs in the Hasse diagram (sequence A342447 in OEIS). The main result is that the differences with respect…

Combinatorics · Mathematics 2025-12-10 Rico Zöllner , Konrad Handrich

Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the first type are permutations turning the order upside down, and…

Combinatorics · Mathematics 2012-10-24 Péter Pál Pach , Michael Pinsker , András Pongrácz , Csaba Szabó

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated…

Combinatorics · Mathematics 2015-12-31 Mathieu Guay-Paquet , Alejandro H. Morales , Eric Rowland

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…

Group Theory · Mathematics 2026-03-09 Sachin Ballal , Tushar Halder

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

We study three different poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The…

Combinatorics · Mathematics 2007-05-23 Jan Snellman

Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice…

Combinatorics · Mathematics 2026-04-17 Michael Dougherty , Gina Root

This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…

Combinatorics · Mathematics 2024-01-09 Arnauld Mesinga Mwafise

We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…

Combinatorics · Mathematics 2021-01-14 Philippe Biane , Matthieu Josuat-Vergès

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

Combinatorics · Mathematics 2025-05-20 Joel Brewster Lewis , Jiayuan Wang

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

Combinatorics · Mathematics 2020-10-14 Antoine Abram , Nathan Chapelier-Laget , Christophe Reutenauer

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the (3+1)-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have…

Combinatorics · Mathematics 2014-04-18 Mathieu Guay-Paquet , Alejandro H. Morales , Eric Rowland

In this paper, we analyze the toggle group on the set of antichains of a poset. Toggle groups, generated by simple involutions, were first introduced by Cameron and Fon-Der-Flaass for order ideals of posets. Recently Striker has motivated…

Combinatorics · Mathematics 2019-02-26 Michael Joseph

A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated…

Combinatorics · Mathematics 2013-03-08 Christos A. Athanasiadis , Yuval Roichman
‹ Prev 1 2 3 10 Next ›