English
Related papers

Related papers: Nombre de factorisations d'un grand cycle

200 papers

Let $p>7$ be a prime, let $G=\Z/p\Z$, and let $S_1=\prod_{i=1}^p g_i$ and $S_2=\prod_{i=1}^p h_i$ be two sequences with terms from $G$. Suppose that the maximum multiplicity of a term from either $S_1$ or $S_2$ is at most $\frac{2p+1}{5}$.…

Combinatorics · Mathematics 2007-10-22 David J. Grynkiewicz , Jujuan Zhuang

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

Combinatorics · Mathematics 2014-06-11 Tewodros Amdeberhan , Victor H. Moll

We use actions by finite cyclic groups to derive generalizations of three classical theorems from elementary number theory.

Number Theory · Mathematics 2007-05-23 Tyler J. Evans

We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we…

Combinatorics · Mathematics 2022-09-08 Kevin Ford

A formula for factorizations of the full twist in the braid group $Br_{2m}$ depending on any four factorizations of the full twist in $Br_{m}$ is given. Applying this formula, a symplectic 4-manifold $X$ and two isotopic generic coverings…

Algebraic Geometry · Mathematics 2007-05-23 Vik. S. Kulikov

We give partial results on the factorization conjecture on codes proposed by Schutzenberger. We consider finite maximal codes C over the alphabet A = {a, b} with C \cap a^* = a^p, for a prime number p. Let P, S in Z <A>, with S = S_0 + S_1,…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Clelia De Felice

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

Combinatorics · Mathematics 2007-11-05 Robert Parviainen

We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.

Classical Analysis and ODEs · Mathematics 2015-11-11 Vadim B. Kuznetsov , Evgeny K. Sklyanin

This paper studies the largest cycles consisted by the quadratic residues modulo prime numbers. We give some formulae about the maximum length of the cycles. Especially, the formula for modulo Fermat primes is given.

Number Theory · Mathematics 2016-01-29 Haifeng Xu

The complex irreducible representations of the symmetric group carry an important canonical basis called the Kazhdan-Lusztig basis. Although it is difficult to express how general permutations act on this basis, some distinguished…

Combinatorics · Mathematics 2022-06-13 Fern Gossow , Oded Yacobi

Several musical scales, like the major scale, can be described as finite arithmetic sequences modulo octave, i.e. chunks of an arithmetic sequence in a cyclic group. Hence the question of how many different arithmetic sequences in a cyclic…

Group Theory · Mathematics 2009-09-02 Emmanuel Amiot

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

Discrete Mathematics · Computer Science 2021-04-10 Rachel N. Berman , Ron M. Roth

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…

Commutative Algebra · Mathematics 2019-12-02 Alfred Geroldinger , Qinghai Zhong

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Combinatorics · Mathematics 2016-10-18 Jacob Sprittulla

We give two combinatorial proofs of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number…

Combinatorics · Mathematics 2022-03-22 Jang Soo Kim , Seunghyun Seo , Heesung Shin

For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length…

Combinatorics · Mathematics 2021-02-05 Stephan Ramon Garcia , Mohamed Omar , Christopher O'Neill , Samuel Yih

Given a finite subset S in F_p^d, let a(S) be the number of distinct r-tuples (x_1,...,x_r) in S such that x_1+...+x_r = 0. We consider the "moments" F(m,n) = sum_|S|=n a(S)^m. Specifically, we present an explicit formula for F(m,n) as a…

Representation Theory · Mathematics 2008-08-22 Erik Carlsson

We prove the cyclic sum formulas for certain two-parameter multiple series. These are new and non-trivial generalizations of the cyclic sum formulas for multiple zeta values and multiple zeta-star values.

Number Theory · Mathematics 2022-06-03 Masahiro Igarashi

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

Quantum Algebra · Mathematics 2014-02-26 Óscar Cortadellas , Javier López Peña , Gabriel Navarro

Subsequently to the author's preceding paper, we give full proofs of some explicit formulas about factorizations of $K$-$k$-Schur functions associated with any multiple $k$-rectangles.

Combinatorics · Mathematics 2017-04-28 Motoki Takigiku
‹ Prev 1 4 5 6 7 8 10 Next ›