English
Related papers

Related papers: Involutions Restricted by 3412, Continued Fraction…

200 papers

We study the quantum evolution under the combined action of the exponentials of two not necessarily commuting operators. We consider the limit in which the two evolutions alternate at infinite frequency. This case appears in a plethora of…

Quantum Physics · Physics 2019-10-02 Daniel Burgarth , Paolo Facchi , Giovanni Gramegna , Saverio Pascazio

Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of…

Combinatorics · Mathematics 2017-06-12 Christian Bean , Anders Claesson , Henning Ulfarsson

We study permutations $p$ such that both $p$ and $p^2$ avoid a given pattern $q$. We obtain a generating function for the case of $q=312$ (equivalently, $q=231$), we prove that if $q$ is monotone increasing, then above a certain length,…

Combinatorics · Mathematics 2019-06-06 Miklos Bona , Rebecca Smith

Non-closedness of subexponentiality by the convolution operation is well-known. We go a step further and show that subexponentiality and non-subexponentiality are generally changeable by the convolution. We also give several conditions, by…

Probability · Mathematics 2023-09-01 Muneya Matsui , Toshiro Watanabe

Recently, Hong and Li launched a systematic study of length-four pattern avoidance in inversion sequences, and in particular, they conjectured that the number of $0021$-avoiding inversion sequences can be enumerated by the OEIS entry…

Combinatorics · Mathematics 2022-09-27 Shane Chern , Shishuo Fu , Zhicong Lin

A permutation $\sigma\in\mathfrak{S}_n$ is simsun if for all $k$, the subword of $\sigma$ restricted to $\{1,...,k\}$ does not have three consecutive decreasing elements. The permutation $\sigma$ is double simsun if both $\sigma$ and…

Combinatorics · Mathematics 2010-04-23 Wan-Chen Chuang , Sen-Peng Eu , Tung-Shan Fu , Yeh-Jong Pan

For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…

Number Theory · Mathematics 2023-11-28 P Vanchinathan , Anitha G

We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…

High Energy Physics - Theory · Physics 2014-01-30 A. Mironov , A. Morozov , An. Morozov

We provide a complete set of supersymmetric constraints for the anomalous dimensions of the conformal twist-two operators to all orders of perturbation theory. Employing them we derive new relations between the exclusive evolution kernels…

High Energy Physics - Phenomenology · Physics 2009-10-31 A. V. Belitsky , D. Müller

In the first part of this paper we discuss the completeness of two general classes of weighted inductive limits of spaces of ultradifferentiable functions. In the second part we study their duals and characterize these spaces in terms of…

Functional Analysis · Mathematics 2019-08-20 Andreas Debrouwere , Jasson Vindas

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…

Combinatorics · Mathematics 2010-08-16 David Callan

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

Complex Variables · Mathematics 2008-04-15 Milan Janjic

We prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern equals (n-2)2^(n-3). We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern.…

Combinatorics · Mathematics 2007-05-23 Aaron Robertson

We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…

q-alg · Mathematics 2008-02-03 Dror Bar-Natan

Let I_n(\pi) denote the number of involutions in the symmetric group S_n which avoid the permutation \pi. We say that two permutations \alpha,\beta\in\S{j} may be exchanged if for every n, k, and ordering \tau of j+1,...,k, we have…

Combinatorics · Mathematics 2007-05-23 Aaron D. Jaggard

Consider a bisexual population such that the set of females can be partitioned into finitely many different types indexed by $\{1,2,\dots,n\}$ and, similarly, that the male types are indexed by $\{1,2,\dots,\nu \}$. Recently an evolution…

Dynamical Systems · Mathematics 2016-01-05 A. Dzhumadil'daev , B. A. Omirov , U. A. Rozikov

Motivated by recent studies of large Mallows$(q)$ permutations, we propose a class of random permutations of $\mathbb{N}_{+}$ and of $\mathbb{Z}$, called regenerative permutations. Many previous results of the limiting Mallows$(q)$…

Probability · Mathematics 2019-06-18 Jim Pitman , Wenpin Tang

In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In three essentially different cases, the numbers of such…

Combinatorics · Mathematics 2007-05-23 T. Mansour , S. Kitaev

We show that, if truth assignments on $n$ variables reproduce through recombination so that satisfaction of a particular Boolean function confers a small evolutionary advantage, then a polynomially large population over polynomially many…

Computational Complexity · Computer Science 2014-08-13 Adi Livnat , Christos Papadimitriou , Aviad Rubinstein , Gregory Valiant , Andrew Wan

We investigate the structure of the two permutation classes defined by the sets of forbidden patterns {1234,2341} and {1243,2314}. By considering how the Hasse graphs of permutations in these classes can be built from a sequence of rooted…

Combinatorics · Mathematics 2018-05-25 David Bevan