English
Related papers

Related papers: Permutation classes of every growth rate above 2.4…

200 papers

In a recent paper of Feng and Sidorov they show that for $\beta\in(1,\frac{1+\sqrt{5}}{2})$ the set of $\beta$-expansions grows exponentially for every $x\in(0,\frac{1}{\beta-1})$. In this paper we study this growth rate further. We also…

Dynamical Systems · Mathematics 2013-05-27 Simon Baker

We prove that, for any $\varepsilon>0$, the number of real quadratic fields $\mathbb{Q}(\sqrt{d})$ of discriminant $d<x$ whose class number is $\ll \sqrt{d}(\log{d})^{-2}(\log\log{d})^{-1}$ is at least $x^{1/2-\varepsilon}$ for $x$ large…

Number Theory · Mathematics 2025-06-27 Riccardo Bernardini

We study the growth rate of the hard squares lattice gas, equivalent to the number of independent sets on the square lattice, and two related models - non-attacking kings and read-write isolated memory. We use an assortment of techniques…

Combinatorics · Mathematics 2014-12-01 Yao-ban Chan , Andrew Rechnitzer

We show that the minimal base size $b(G)$ of a finite primitive permutation group $G$ of degree $n$ is at most $2 (\log |G|/\log n) + 24$. This bound is asymptotically best possible since there exists a sequence of primitive permutation…

Group Theory · Mathematics 2018-02-21 Zoltan Halasi , Martin W. Liebeck , Attila Maroti

In this paper, we provide an upper bound for the number of one-element commutation classes of a permutation, that is, the number of reduced words in which no commutation can be applied. Using this upper bound, we prove a conjecture that…

Combinatorics · Mathematics 2026-01-15 Ricardo Mamede , José Luis Santos , Diogo Soares

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Combinatorics · Mathematics 2022-03-01 Tristram Bogart , Juan Andrés Valero

Permutative automorphisms of the Cuntz algebras $\mathcal{O}_n$ are in bijection with the stable permutations of $[n]^k$. They are also the elements of the restricted Weyl group of $Aut(\mathcal{O}_n)$. In this note, we characterize a class…

Group Theory · Mathematics 2025-11-04 Junyao Pan

We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…

Combinatorics · Mathematics 2018-11-21 Golnaz Badkobeh , Pascal Ochem

A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…

Combinatorics · Mathematics 2026-05-29 Collier Gaiser , Paul Horn

Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…

Number Theory · Mathematics 2024-01-22 Gareth A. Jones , Alexander K. Zvonkin

It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of…

Combinatorics · Mathematics 2016-04-01 Francesca Merola , Tommaso Traetta

The research on pattern-avoidance has yielded so far limited knowledge on Wilf-ordering of permutations. The Stanley-Wilf limits sqrt[n](|S_n(tau)|) and further works suggest asymptotic ordering of layered versus monotone patterns. Yet,…

Combinatorics · Mathematics 2009-09-29 Zvezdelina Stankova

In this paper, the extinction problem for a class of distylous plant populations is considered within the framework of certain nonhomogeneous nearest-neighbor random walks in the positive quadrant. For the latter, extinction means…

Probability · Mathematics 2019-11-07 Gerold Alsmeyer , Kilian Raschel

Using graphical methods based on a `lookdown' and pruned version of the {\em ancestral selection graph}, we obtain a representation of the type distribution of the ancestor in a two-type Wright-Fisher population with mutation and selection,…

Probability · Mathematics 2020-03-17 Ellen Baake , Ute Lenz , Anton Wakolbinger

We will prove several expanders with exponent strictly greater than $2$. For any finite set $A \subset \mathbb R$, we prove the following six-variable expander results: \begin{align*} |(A-A)(A-A)(A-A)| &\gg…

Combinatorics · Mathematics 2016-11-17 Antal Balog , Oliver Roche-Newton , Dmitry Zhelezov

We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence $\Psi$, in the language of two total orders, the probability $p_{n,\Psi}$ that a uniform random 231-avoiding…

Combinatorics · Mathematics 2024-04-03 Michael Albert , Mathilde Bouvel , Valentin Féray , Marc Noy

Let $P(n)$ be the probability that two independent, uniformly random permutations of $[n]$ have the same order, and let $K(n)$ be the probability that they are in the same conjugacy class. Answering a question of Thibault Godin, we prove…

Combinatorics · Mathematics 2023-06-22 Huseyin Acan , Charles Burnette , Sean Eberhard , Eric Schmutz , James Thomas

In the present paper, we obtain a general lower bound for the $2$-adic valuation of the algebraic part of the central value of the complex $L$-series for the quadratic twists of any elliptic curve over $\mathbb{Q}$, showing that when the…

Number Theory · Mathematics 2026-01-01 Shuai Zhai

We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any…

Combinatorics · Mathematics 2014-06-09 Antonio Giambruno , Sergey Mishchenko

The Wagstaff numbers $W_p = (2^p + 1)/3$ for odd primes $p$ are the natural $+1$ companions of the Mersenne numbers. Known primality proofs for $W_p$ with $p \geq 2617$ rely on the elliptic-curve primality proving algorithm of Atkin-Morain;…

Number Theory · Mathematics 2026-05-19 Alexey Dolotov
‹ Prev 1 8 9 10 Next ›