English
Related papers

Related papers: Enumeration of Stack-Sorting Preimages via a Decom…

200 papers

We get new Hopf algebras (HA): 1. A wealth of quotient HA's of the Malvenuto-Reutenauer HA (the Loday-Ronco HA being a special case). They consist of the permutations avoiding an {\it arbitrary} set of permutations without global descents,…

Rings and Algebras · Mathematics 2026-04-16 Gunnar Fløystad

The structure of three pattern classes Av(2143, 4321), Av(2143, 4312) and Av(1324, 4312) is determined using the machinery of monotone grid classes. This allows the permutations in these classes to be described in terms of simple diagrams…

Combinatorics · Mathematics 2012-06-15 M. H. Albert , M. D. Atkinson , Robert Brignall

Let $\mathcal{A}$ be an abelian variety over a number field, with a good reduction at a prime ideal containing a prime number $p$. Denote by ${\rm A}$ an abelian variety over a finite field of characteristic $p$, obtained by the reduction…

Algebraic Geometry · Mathematics 2018-10-02 Artyom Smirnov , Alexey Zaytsev

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

Combinatorics · Mathematics 2020-05-19 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

This paper belongs to a series devoted to the study of the cohomology of classifying spaces. Generalizing the Weil algebra of a Lie algebra and Kalkman's BRST model, here we introduce the Weil algebra $W(A)$ associated to any Lie algebroid…

Differential Geometry · Mathematics 2011-02-08 Camilo Arias Abad , Marius Crainic

In this paper, we introduce the notions of motivic representation stability that is an algebraic counterpart of the notion of representation stability. In the process, we also introduce the notion of motivic decomposition for varieties…

Algebraic Geometry · Mathematics 2025-05-13 Márton Hablicsek , Jesse Vogel

Let $K$ be a number field and let $f : (\mathbb{P}^1)^n \to (\mathbb{P}^1)^n$ be a dominant endomorphism defined over $K$. We show that if $V$ is an $f$-invariant subvariety (that is, $f(V)=V$) then there is a positive integer $s_0$ such…

Number Theory · Mathematics 2023-11-13 Xiao Zhong

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…

Combinatorics · Mathematics 2016-08-19 Robert Coquereaux , Jean-Bernard Zuber

We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…

Combinatorics · Mathematics 2021-06-15 Olivier Bernardi

The polynomial deformations of the Witten extensions of the U(su(2)) and U(osp(1,2)) algebras are three generator algebras with normal ordering, admitting a two generator subalgebra. The modules and the representations of these algebras are…

q-alg · Mathematics 2008-02-03 Dennis Bonatsos , C. Daskaloyannis , P. Kolokotronis , D. Lenis

Consider a polynomial $F$ in $m$ variables and a finite point ensemble $S=S_1 \times ... \times S_m$. When given the leading monomial of $F$ with respect to a lexicographic ordering we derive improved information on the possible number of…

Information Theory · Computer Science 2011-01-27 Olav Geil , Casper Thomsen

We determine all 242 Wilf classes of triples of 4-letter patterns by showing that there are 32 non-singleton Wilf classes. There are 317 symmetry classes of triples of 4-letter patterns and after computer calculation of initial terms, the…

Combinatorics · Mathematics 2016-05-18 David Callan , Toufik Mansour , Mark Shattuck

Consider the Birkhoff polytope of n by n doubly-stochastic matrices. As the Birkhoff-von Neumann theorem famously states, its vertex set coincides with the set of all n by n permutation matrices. Here we seek a higher-dimensional analog of…

Combinatorics · Mathematics 2012-08-22 Nathan Linial , Zur Luria

Let $A(\ell,n,k)$ denote the number of $\ell$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We provide a new proof of an explicit formula for $A(\ell,n,k)$…

Combinatorics · Mathematics 2024-04-17 Abdelmalek Abdesselam , Pedro Brunialti , Tristan Doan , Philip Velie

Given three permutations on the integers 1 through n, consider the set system consisting of each interval in each of the three permutations. Jozsef Beck conjectured (c. 1987) that the discrepancy of this set system is O(1). We give a…

Discrete Mathematics · Computer Science 2011-04-18 Alantha Newman , Aleksandar Nikolov

Let $X$ be a finite collection of sets. We count the number of ways a disjoint union of $n-1$ subsets in $X$ is a set in $X$, and estimate this number from above by $|X|^{c(n)}$ where $$ c(n)=\left(1-\frac{(n-1)\ln (n-1)}{n\ln n}…

Analysis of PDEs · Mathematics 2017-07-03 Paata Ivanisvili

We use the author's combinatorial theory of full heaps (defined in math.QA/0605768) to categorify the action of a large class of Weyl groups on their root systems, and thus to give an elementary and uniform construction of a family of…

Combinatorics · Mathematics 2007-05-23 R. M. Green

For the algebraic group $SL_{l+1}(\mathbb{C})$ we describe a system of positive roots associated to conjugacy classes in its Weyl group. Using this we explicitly describe the algebra of regular functions on certain transverse slices to…

Representation Theory · Mathematics 2019-04-30 Lachlan Walker

A set of $N$ permutations of $\{1,2,\dots,v\}$ is $(N,v,t)$-suitable if each symbol precedes each subset of $t-1$ others in at least one permutation. The central problems are to determine the smallest $N$ for which such a set exists for…

Combinatorics · Mathematics 2016-12-02 Justin H. C. Chan , Jonathan Jedwab

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

Combinatorics · Mathematics 2017-05-12 Christian Bean , Bjarki Gudmundsson , Henning Ulfarsson
‹ Prev 1 8 9 10 Next ›