English
Related papers

Related papers: The Expected Shape of Random Doubly Alternating Ba…

200 papers

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…

Combinatorics · Mathematics 2013-01-10 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

In this paper we construct a paramaterized family of annular homeomorphisms with Birkhoff-like rotational attractors that vary continuously with the parameter, are all homeomorphic to the pseudo-circle, display interesting boundary dynamics…

Dynamical Systems · Mathematics 2023-05-12 Jernej Činč , Piotr Oprocha

A permutation $\sigma \in S_n$ is a $k$-superpattern (or $k$-universal) if it contains each $\tau \in S_k$ as a pattern. This notion of "superpatterns" can be generalized to words on smaller alphabets, and several questions about…

Combinatorics · Mathematics 2021-08-13 Zach Hunter

A permutation is said to be cycle-alternating if it has no cycle double rises, cycle double falls or fixed points; thus each index $i$ is either a cycle valley ($\sigma^{-1}(i)>i<\sigma(i)$) or a cycle peak ($\sigma^{-1}(i)<i>\sigma(i)$).…

Combinatorics · Mathematics 2024-12-16 Bishal Deb , Alan D. Sokal

We describe a unifying framework for the systematic construction of integrable deformations of integrable $\sigma$-models within the Hamiltonian formalism. It applies equally to both the `Yang-Baxter' type as well as `gauged WZW' type…

High Energy Physics - Theory · Physics 2015-09-02 Benoit Vicedo

In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…

Combinatorics · Mathematics 2014-03-04 Ilse Fischer , Lukas Riegler

We generalize the results of Ksavrelof and Zeng about the multidistribution of the excedance number of $S_n$ with some natural parameters to the colored permutation group and to the Coxeter group of type $D$. We define two different orders…

Combinatorics · Mathematics 2007-05-23 Eli Bagno , David Garber

Recently, it has been shown [arXiv:1106.3482] that the two-Higgs-doublet-model potential may exhibit a maximum of 13 distinct accidental symmetries. Such a classification is based on a six-dimensional bilinear scalar field formalism…

High Energy Physics - Phenomenology · Physics 2015-05-30 Apostolos Pilaftsis

In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and Morris, and of Mazur, we show that the following holds for every fixed $\lambda > 2$…

Combinatorics · Mathematics 2020-10-19 Marcelo Campos , Maurício Collares , Robert Morris , Natasha Morrison , Victor Souza

Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number…

Combinatorics · Mathematics 2007-05-23 T. Mansour

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

Combinatorics · Mathematics 2009-09-17 Michael Lugo

We show that an infinite family of N=6 d=3 superconformal Chern-Simons-matter theories has hidden N=8 superconformal symmetry and hidden parity on the quantum level. This family of theories is different from the one found by Aharony,…

High Energy Physics - Theory · Physics 2015-05-27 Denis Bashkirov , Anton Kapustin

We present a bijection between cyclic permutations of {1,2,...,n+1} and permutations of {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. This non-trivial bijection involves a Foata-like…

Combinatorics · Mathematics 2012-02-02 Sergi Elizalde

The strange form factors of baryon octet are evaluated, in the chiral models with the general chiral SU(3) group structure, to yield the theoretical predictions comparable to the recent experimental data of SAMPLE Collaboration and to study…

High Energy Physics - Phenomenology · Physics 2010-12-13 Soon-Tae Hong

A dual formulation of the S Matrix for N=4 SYM has recently been presented, where all leading singularities of n-particle N^{k-2}MHV amplitudes are given as an integral over the Grassmannian G(k,n), with cyclic symmetry, parity and…

High Energy Physics - Theory · Physics 2015-05-14 Nima Arkani-Hamed , Freddy Cachazo , Clifford Cheung

Recently, Bagno, Garber and Mansour studied a kind of excedance number on the complex reflection groups and computed its multidistribution with the number of fixed points on the set of involutions in these groups. In this note, we consider…

Combinatorics · Mathematics 2007-05-23 Toufik Mansour , Yidong Sun

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…

Combinatorics · Mathematics 2010-03-26 Anders Claesson , Sergey Kitaev , Einar Steingrimsson

In this article we answer a question asked by Chien et al. in arXiv:2304.06050 in which they study the numerical range of weighted cyclic matrices under permutation of their entries. Namely, we are interested in how $w(A_\sigma)$ fluctuates…

Functional Analysis · Mathematics 2025-12-30 Simon Marionnet

Billey, Konvalinka, Petersen, Solfstra, and Tenner recently presented a method for counting parabolic double cosets in Coxeter groups, and used it to compute $p_n$, the number of parabolic double cosets in $S_n$, for $n\leq13$. In this…

Combinatorics · Mathematics 2021-08-19 Thomas Browning

In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n > 2$. We construct $16$…

Number Theory · Mathematics 2016-09-27 Simone Ugolini
‹ Prev 1 8 9 10 Next ›