English
Related papers

Related papers: Vincular pattern posets and the M\"obius function …

200 papers

In a proof of the three gaps theorem, a class of permutations known as the S\'{o}s permutations was introduced. It is known that a S\'{o}s permutation, as a sequence, satisfies a certain recurrence (S\'{o}s's recurrence), however, whether…

Combinatorics · Mathematics 2024-08-21 Makoto Nagata , Yoshinori Takei

In our previous paper "Strata Hasse invariants, Hecke algebras and Galois representations", initially motivated by questions about the Hodge line bundle of a Hodge-type Shimura variety, we singled out a generalization of the notion of {\em…

Number Theory · Mathematics 2018-09-27 Wushi Goldring , Jean-Stefan Koskivirta

A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…

Combinatorics · Mathematics 2025-08-20 Nicholas J. Williams

We show that a group admits a non-zero homogeneous quasimorphism if and only if it admits a certain type of action on a poset. Our proof is based on a construction of quasimorphisms which generalizes Poincar\'e--Ghys' construction of the…

Group Theory · Mathematics 2011-07-12 Gabi Ben Simon , Tobias Hartnick

Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…

q-alg · Mathematics 2008-02-03 Elisa Ercolessi , Giovanni Landi , Paulo Teotonio-Sobrinho

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Rodica Simion

We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…

Combinatorics · Mathematics 2011-04-08 Svante Janson

We define semi-pointed partition posets, which are a generalisation of partition posets and show that they are Cohen-Macaulay. We then use multichains to compute the dimension and the character for the action of the symmetric groups on…

Combinatorics · Mathematics 2015-06-04 Bérénice Delcroix-Oger

In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorting algorithms. A natural generalization of this set leads us…

Combinatorics · Mathematics 2007-10-29 Sergi Elizalde

Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…

Combinatorics · Mathematics 2020-12-23 Matthew McDevitt , Nik Ruskuc

We show that all $q$-semimultiplicative sequences are asymptotically orthogonal to the M\"obius function, thus proving the Sarnak conjecture for this class of sequences. This generalises analogous results for the sum-of-digits function and…

Number Theory · Mathematics 2018-08-21 Jakub Konieczny

Let $\Omega$ be the set of odd positive integers and let $S:\Omega \rightarrow \Omega$ be the Syracuse function. It is proved that, for every permutation $\sigma$ of $(1,2,3)$, the set of triples of the form $(m,S(m),S^2(m))$ with…

Number Theory · Mathematics 2024-09-26 Melvyn B. Nathanson

In the same way decomposition spaces, also known as unital 2-Segal spaces, have incidence (co)algebras, and certain relative decomposition spaces have incidence (co)modules, we identify the structures that have incidence bi(co)modules: they…

Algebraic Topology · Mathematics 2020-03-11 Louis Carlier

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

The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval…

Discrete Mathematics · Computer Science 2024-06-25 Eli Bagno , Estrella Eisenberg , Shulamit Reches , Moriah Sigron

In this paper, we study properties and patterns on permutations of multisets whose multivariate generating functions are symmetric. We interpret this phenomenon through the lens of group actions and define such a property or pattern as…

Combinatorics · Mathematics 2026-02-17 Shaoshi Chen , Hanqian Fang , Sergey Kitaev

A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and…

Combinatorics · Mathematics 2024-10-07 Gabriel Crudele , Peter Dukes , Jonathan A. Noel

This article studies the quasi-stationary behaviour of multidimensional birth and death processes, modeling the interaction between several species, absorbed when one of the coordinates hits 0. We study models where the absorption rate is…

Probability · Mathematics 2015-08-14 Nicolas Champagnat , Denis Villemonais

This paper is devoted to characterizing the so-called order isomorphisms intertwining the $L^2$-semigroups of two Dirichlet forms. We first show that every unitary order isomorphism intertwining semigroups is the composition of…

Functional Analysis · Mathematics 2022-04-08 Liping Li , Hanlai Lin

In the development of operational semantics of concurrent systems, a key decision concerns the adoption of a suitable notion of execution model, which basically amounts to choosing a class of partial orders according to which events are…

Formal Languages and Automata Theory · Computer Science 2024-07-19 Maciej Koutny , Lukasz Mikulski
‹ Prev 1 3 4 5 6 7 10 Next ›