English
Related papers

Related papers: A note on a question due to A. Garsia

200 papers

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…

Group Theory · Mathematics 2012-05-09 John Bamberg , Nick Gill , Thomas Hayes , Harald Helfgott , Ákos Seress , Pablo Spiga

We prove an analog of Aldous' spectral gap conjecture in the generalized symmetric groups $G\wr S_n$ where $G$ is an arbitrary finite group. Moreover, we show that Caputo's extension of the conjecture to hypergraphs transfers to these…

Group Theory · Mathematics 2026-05-22 Niv Levhari , Doron Puder

We derive heuristically the approximate formula for the difference $\sqrt{p_{n+1}} - \sqrt{p_n}$, where $p_n$ is the n-th prime. We find perfect agreement between this formula and the available data from the list of maximal gaps between…

Number Theory · Mathematics 2010-10-20 Marek Wolf

In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass…

Combinatorics · Mathematics 2023-06-22 Enrica Duchi

We give a simple proof of a major index determinant formula in the symmetric group discovered by Krattenthaler and first proved by Thibon using noncommutative symmetric functions. We do so by proving a factorization of an element in the…

Combinatorics · Mathematics 2021-02-26 Thomas McConville , Donald Robertson , Clifford Smyth

We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…

Combinatorics · Mathematics 2014-03-04 William Kuszmaul

We study Morse representations of discrete subgroups in higher rank semi-simple Lie groups defined by M. Kapovich, B. Leeb and J. Porti. We show that, if a sequence of Morse representations $\rho_n : \Gamma \rightarrow G$ is (strongly)…

Geometric Topology · Mathematics 2017-11-20 Louis Merlin

We investigate the summability in sense of Cesaro and its applications to investigation of the mean values of multiplicative functions on permutations.

Classical Analysis and ODEs · Mathematics 2008-11-10 Vytas Zacharovas

We show that for $n \ge 6$ every even permutation on $n$ symbols is the commutator of two $n$-cycles. More precisely, let $S_n$ be the symmetric group and $A_n$ the alternating group. Let $C(n) \subset S_n$ denote the conjugacy class of…

Group Theory · Mathematics 2025-10-14 Philipp Bader

We give explicit formulae for a class of complex linear unitary characters of the congruence subgroups $\Gamma_0(N)$ which involve a variant of Rademacher's $\Psi$ function. We then prove that these characters cover all characters of…

Number Theory · Mathematics 2025-06-04 Xiao-Jie Zhu

R. Stanley has found a nice combinatorial formula for characters of irreducible representations of the symmetric group of rectangular shape. Then, he has given a conjectural generalisation for any shape. Here, we will prove this formula…

Combinatorics · Mathematics 2010-01-25 Valentin Féray

Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of…

Combinatorics · Mathematics 2015-02-25 Scott Garrabrant , Igor Pak

A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1,…

Discrete Mathematics · Computer Science 2016-01-19 Bhadrachalam Chitturi , Krishnaveni K S

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Combinatorics · Mathematics 2023-06-22 David Dong

We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing…

Combinatorics · Mathematics 2017-09-18 Michael Albert , Aistis Atminas , Robert Brignall

In this article, we extend some results about algebra $A$ with the group of units $U(A)$ having a special polynomial identity, Laurent polynomial. And we present a new version of B. Hartley Conjecture with these identities.

Rings and Algebras · Mathematics 2020-12-04 Claudenir Freire Rodrigues

In the note, the author discovers an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind.

Number Theory · Mathematics 2025-02-25 Feng Qi

We construct a statistic-swapping involution on the Cartesian product of the generalized symmetric group $S(k,n)$ with the symmetric group $S_{kn}$, which swaps the number of fixed points in the generalized symmetric group element with the…

Combinatorics · Mathematics 2026-02-12 Peter Kagey , Kai Mawhinney

A conjecture by R. Stanley on a class of alternating permutations, which is proved by R. Chapman and L. Williams states that alternating permutations with the maximal number of fixed points is equidistributed with derangements. We extend…

Combinatorics · Mathematics 2015-03-24 Kyoungsuk Park

Recently, E. Samsonadze (arXiv:2411.11859v1) has given an explicit formula for the sums of powers of integers $S_k(n) = 1^k +2^k +\cdots + n^k$. In this short note, we show that Samsonadze's formula corresponds to a well-known formula for…

General Mathematics · Mathematics 2025-03-21 José L. Cereceda
‹ Prev 1 3 4 5 6 7 10 Next ›