English
Related papers

Related papers: Equivalence classes of lower and upper descent wea…

200 papers

Given a semigroup $S$, for each Green's relation $\mathcal{K}\in\{\mathcal{L},\mathcal{R},\mathcal{J},\mathcal{H}\}$ on $S,$ the $\mathcal{K}$-height of $S,$ denoted by $H_{\mathcal{K}}(S),$ is the height of the poset of…

Combinatorics · Mathematics 2024-07-12 Matthew Brookes , Craig Miller

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

Combinatorics · Mathematics 2023-11-28 Jennifer Elder

Motivated by classification, up to order isomorphism, of some dense subgroups of Euclidean space that are free of minimal rank, we obtain apparently new invariants for an equivalence relation (intermediate between Hermite and Smith) on…

Commutative Algebra · Mathematics 2017-03-14 David Handelman

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

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

Combinatorics · Mathematics 2011-01-26 Matthew J. Samuel

Given an essential semilattice congruence $\equiv$ on the left weak order of a Coxeter group $W$, we define the Coxeter stack-sorting operator ${\bf S}_\equiv:W\to W$ by ${\bf S}_\equiv(w)=w\left(\pi_\downarrow^\equiv(w)\right)^{-1}$, where…

Combinatorics · Mathematics 2022-03-08 Colin Defant

Arrangements of pseudohyperplanes are widely studied in computational geometry. A rich subclass of pseudohyerplane arrangements, which has gained more attention in recent years, is the so-called signotopes. Introduced by Manin and…

Combinatorics · Mathematics 2025-02-25 Helena Bergold , Lukas Egeling , Hung. P. Hoang

In this paper we study pattern-replacement equivalence relations on the set $S_n$ of permutations of length $n$. Each equivalence relation is determined by a set of patterns, and equivalent permutations are connected by pattern-replacements…

Combinatorics · Mathematics 2020-09-11 Michael Ma

We prove Feigin-Frenkel type dualities between subregular W-algebras of type A, B and principal W-superalgebras of type $\mathfrak{sl}(1|n), \mathfrak{osp}(2|2n)$. The type A case proves a conjecture of Feigin and Semikhatov. Let…

Quantum Algebra · Mathematics 2021-03-18 Thomas Creutzig , Naoki Genra , Shigenori Nakatsuka

In the first part of this paper, we discuss the classical W-algebra $\mathcal{W}(\mathfrak{g}, F)$ associated with a Lie superalgebra $\mathfrak{g}$ and the nilpotent element $F$ in an $\mathfrak{sl}_2$-triple. We find a generating set of…

Representation Theory · Mathematics 2020-04-20 Uhi Rinn Suh

Let ${\mathscr L}=(X,\preceq)$ be a lattice. For ${\cal P}\subseteq X$ we say that ${\cal P}$ is $t$-{\it intersecting} if ${\sf rank}(x\wedge y)\ge t$ for all $x,y\in{\cal P}$. The seminal theorem of Erd\H{o}s, Ko and Rado describes the…

Combinatorics · Mathematics 2019-04-03 Susanna Fishel , Glenn Hurlbert , Vikram Kamat , Karen Meagher

We say that a first order sentence A defines a graph G if A is true on G but false on any graph non-isomorphic to G. Let L(G) (resp. D(G)) denote the minimum length (resp. quantifier rank) of a such sentence. We define the succinctness…

Logic · Mathematics 2007-05-23 Oleg Pikhurko , Joel Spencer , Oleg Verbitsky

The hypercontractive inequality is a fundamental result in analysis, with many applications throughout discrete mathematics, theoretical computer science, combinatorics and more. So far, variants of this inequality have been proved mainly…

Discrete Mathematics · Computer Science 2020-10-28 Yuval Filmus , Guy Kindler , Noam Lifshitz , Dor Minzer

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$-spaces instead of restricting to posets. In this paper, we respond to this calling by…

Logic in Computer Science · Computer Science 2017-09-12 Hadrian Andradi , Weng Kin Ho

The Witt group of nondegenerate braided fusion categories $\mathcal{W}$ contains a subgroup $\mathcal{W}_\text{un}$ consisting of Witt equivalence classes of pseudo-unitary nondegenerate braided fusion categories. For each…

Quantum Algebra · Mathematics 2017-03-08 Andrew Schopieray

We construct a strongly local symmetric Dirichlet form on the configuration space $\Upsilon$ whose symmetrising (thus also invariant) measure is $\mathsf{sine}_\beta$, which is the law of the sine $\beta$ ensemble for every $\beta>0$. For…

Probability · Mathematics 2025-06-05 Kohei Suzuki

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

We start by identifying a class of pseudo-differential operators, generated by the set of continuous negative definite functions, that are in the weak similarity (WS) orbit of the self-adjoint log-Bessel operator on the Euclidean space.…

Probability · Mathematics 2023-01-18 Pierre Patie , Rohan Sarkar

The infinite affine Lie algebras of type ABCD, also called $\widehat{\mathfrak{gl}}(\infty)$, $\widehat{\mathfrak{o}}(\infty)$, $\widehat{\mathfrak{sp}}(\infty)$, are equivalent to subalgebras of the quantum $W_{1+\infty}$ algebras. They…

High Energy Physics - Theory · Physics 2021-06-16 Jean-Emile Bourgine

The juxtaposition of permutation classes $\mathcal{C}$ and $\mathcal{D}$ is the class of all permutations formed by concatenations $\sigma\tau$, such that $\sigma$ is order isomorphic to a permutation in $\mathcal{C}$, and $\tau$ to a…

Combinatorics · Mathematics 2023-12-20 Robert Brignall