English
Related papers

Related papers: Regular Structures in Kronecker Permutations

200 papers

We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…

Probability · Mathematics 2011-01-06 Volker Betz , Daniel Ueltschi , Yvan Velenik

An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n \geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n\geq 1}$ is uniformly distributed modulo one for…

Number Theory · Mathematics 2016-03-17 Christoph Aistleitner , Gerhard Larcher

Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…

Logic in Computer Science · Computer Science 2023-06-22 Brijesh Dongol , Ian J. Hayes , Georg Struth

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…

Combinatorics · Mathematics 2024-01-12 Abdelmalek Abdesselam

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

Classical Analysis and ODEs · Mathematics 2015-01-20 Marc Carnovale

Each positive increasing integer sequence $\{a_n\}_{n\geq 0}$ can serve as a numeration system to represent each non-negative integer by means of suitable coefficient strings. We analyse the case of $k$-generalized Fibonacci sequences…

Combinatorics · Mathematics 2022-04-22 Elena Barcucci , Antonio Bernini , Renzo Pinzani

We show that for any integer n and any field k of characteristic different from 2 there are at most finitely many isomorphism classes of quadratic morphisms from the projective line over k to itself with a finite postcritical orbit of size…

Algebraic Geometry · Mathematics 2013-08-27 Richard Pink

The Terwilliger algebras of asymmetric association schemes of rank $3$, whose nonidentity relations correspond to doubly regular tournaments, are shown to have thin irreducible modules, and to always be of dimension $4k+9$ for some positive…

Combinatorics · Mathematics 2024-04-18 Allen Herman

We relate the $m$-truncated Kronecker products of symmetric functions to the semi-invariant rings of a family of quiver representations. We find cluster algebra structures for these semi-invariant rings when $m=2$. Each {\sf g}-vector cone…

Representation Theory · Mathematics 2015-08-26 Jiarui Fei

We conjecture unimodality for some sequences of generalized Kronecker coefficients and prove it for partitions with at most two columns. The proof is based on a hard Lefschetz property for corresponding highest weight spaces. We also study…

Combinatorics · Mathematics 2023-12-29 Alimzhan Amanov , Damir Yeliussizov

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

Combinatorics · Mathematics 2026-03-31 Verónica Borrás-Serrano , Isabel Byrne , Anant Godbole , Nathaniel Veimau

We introduce some new classes of words and permutations characterized by the second difference condition $\pi(i-1) + \pi(i+1) - 2\pi(i) \leq k$, which we call the $k$-convexity condition. We demonstrate that for any sized alphabet and…

Combinatorics · Mathematics 2015-07-08 Christopher Coscia , Jonathan DeWitt

Polynomially-recursive sequences generally have a periodic behavior mod $m$. In this paper, we analyze the period mod $m$ of a second order polynomially-recursive sequence. The problem originally comes from an enumeration of avoiding…

Number Theory · Mathematics 2019-03-07 Cyril Banderier , Florian Luca

Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating…

Combinatorics · Mathematics 2021-11-30 Zuling Chang , Jie Xue

For irrational $\alpha$, $\{n\alpha\}$ is uniformly distributed mod 1 in the Weyl sense, and the asymptotic behavior of its discrepancy is completely known. In contrast, very few precise results exist for the discrepancy of subsequences…

Number Theory · Mathematics 2023-03-15 Istvan Berkes , Bence Borda

In this paper, we classify the irreducible representations of the rational Cherednik algebras of rank 1 in characteristic p > 0. There are two cases. One is the "quantum" case, where "Planck's constant" is nonzero and generic irreducible…

Representation Theory · Mathematics 2007-05-23 Frédéric Latour

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

Emmanuel Kowalski and William Sawin proved, using a deep independence result of Kloosterman sheaves, that the polygonal paths joining the partial sums of the normalized classical Kloosterman sums S(a,b0;p)/p^{1/2} converge in the sense of…

Number Theory · Mathematics 2017-09-20 Guillaume Ricotta , Emmanuel Royer

We consider commuting squares of finite dimensional von Neumann algebras having the algebra of complex numbers in the lower left corner. Examples include the vertex models, the spin models (in the sense of subfactor theory) and the…

Operator Algebras · Mathematics 2007-05-23 Teodor Banica

This article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are…

Discrete Mathematics · Computer Science 2012-01-17 Pierrot Adeline , Rossin Dominique