English
Related papers

Related papers: The largest singletons in weighted set partitions …

200 papers

We present a simplified variant of Biane's bijection between permutations and 3-colored Motzkin paths with weight that keeps track of the inversion number, excedance number and a statistic so-called depth of a permutation. This generalizes…

Combinatorics · Mathematics 2024-06-25 Sen-Peng Eu , Tung-Shan Fu , Yuan-Hsun Lo

We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…

Representation Theory · Mathematics 2017-03-22 Arvind Ayyer , Amritanshu Prasad , Steven Spallone

Let the random variable $Z_{n,k}$ denote the number of increasing subsequences of length $k$ in a random permutation from $S_n$, the symmetric group of permutations of $\{1,...,n\}$. We show that $Var(Z_{n,k_n})=o((EZ_{n,k_n})^2)$ as $…

Probability · Mathematics 2007-05-23 Ross Pinsky

Let a deck of n cards be shuffled by successively exchanging the cards in positions 1, 2, ..., n with cards in randomly chosen positions. We show that for n equal to 18 or greater, the identity permutation is the most likely. We prove a…

Combinatorics · Mathematics 2018-06-19 Daniel Goldstein , David Moews

We prove a formula expressing the Kerov polynomial $\Sigma_k$ as a weighted sum over the lattice of noncrossing partitions of the set $\{1,...,k+1\}$. In particular, such a formula is related to a partial order $\mirr$ on the Lehner's…

Combinatorics · Mathematics 2009-08-11 P. Petrullo , D. Senato

A classical argument was introduced by Khintchine in 1926 in order to exhibit the existence of totally irrational singular linear forms in two variables. This argument was subsequently revisited and extended by many authors. For instance,…

Number Theory · Mathematics 2026-01-14 Dmitry Kleinbock , Nikolay Moshchevitin , Jacqueline Warren , Barak Weiss

We consider the problem of finding an independent set of maximum weight simultaneously contained in $k$ matroids over a common ground set. This $k$-matroid intersection problem appears naturally in many contexts, for example in generalizing…

Data Structures and Algorithms · Computer Science 2024-12-10 Neta Singer , Theophile Thiery

The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez & Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…

Dynamical Systems · Mathematics 2011-10-27 Primitivo B. Acosta-Humánez , Eduardo Martínez Castiblanco

Consider a finite field $\mathbb{F}_q$ and positive integers $d,m,r$ with $1\leq r\leq \binom{m+d}{d}$. Let $S_d(m)$ be the $\mathbb{F}_q$ vector space of all homogeneous polynomials of degree $d$ in $X_0,\dots,X_m$. Let $e_r(d,m)$ be the…

Algebraic Geometry · Mathematics 2025-05-21 Deepesh Singhal , Yuxin Lin

Let $w$ be a weight on the unit disk $\mathbb{D}$ having the form \[w(z)=|v(z)|^2\prod_{k=1}^s\left|\frac{z-a_k}{1-z\overline{a}_k}\right|^{m_k}\,,\quad m_k>-2,\ |a_k|<1,\] where $v$ is analytic and free of zeros in $\overline{\mathbb{D}}$,…

Classical Analysis and ODEs · Mathematics 2023-10-12 Erwin Miña-Díaz

We develop and analyze a method to reduce the size of a very large set of data points in a high dimensional Euclidean space R d to a small set of weighted points such that the result of a predetermined data analysis task on the reduced set…

Data Structures and Algorithms · Computer Science 2018-07-13 Dan Feldman , Melanie Schmidt , Christian Sohler

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

Combinatorics · Mathematics 2026-05-01 Ben Green , Mehtaab Sawhney

We discuss the properties and the permutation behaviour of the reversed Dickson polynomials of the $(k+1)$-th kind $D_{n,k}(1,x)$ over finite fields. The results in this paper unify and generalize several recently discovered results on…

Number Theory · Mathematics 2016-05-17 Neranga Fernando

We utilize false theta function results of Nathan Fine to discover three new partition identities involving weights. These relations connect G\"ollnitz--Gordon type partitions and partitions with distinct odd parts, partitions into distinct…

Combinatorics · Mathematics 2016-11-09 Alexander Berkovich , Ali Kemal Uncu

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

Combinatorics · Mathematics 2025-07-08 Bruce E Sagan , Sheila Sundaram

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

Probability · Mathematics 2020-07-01 Jacopo Borga , Mathilde Bouvel , Valentin Féray , Benedikt Stufler

A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…

Data Structures and Algorithms · Computer Science 2024-01-03 Pascal Koiran

In a recent paper ([1],[2]) we have classified explicitely all the unitary highest weight representations of non compact real forms of semisimple Lie Algebras on Hermitian symmetric space. These results are necessary in order to construct…

Mathematical Physics · Physics 2007-05-23 J. Garcia-Escudero , M. Lorente

We study the number of lattice points in integer dilates of the rational polytope $P = (x_1,...,x_n) \in \R_{\geq 0}^n : \sum_{k=1}^n x_k a_k \leq 1$, where $a_1,...,a_n$ are positive integers. This polytope is closely related to the linear…

Number Theory · Mathematics 2007-05-23 Matthias Beck , Ricardo Diaz , Sinai Robins

A permutation of n letters is k-prolific if each (n-k)-subset of the letters in its one-line notation forms a unique pattern. We present a complete characterization of k-prolific permutations for each k, proving that k-prolific permutations…

Combinatorics · Mathematics 2018-05-25 David Bevan , Cheyne Homberger , Bridget Eileen Tenner
‹ Prev 1 8 9 10 Next ›