中文
相关论文

相关论文: Excedance numbers for permutations in complex refl…

200 篇论文

We enumerate the number of complex irreducible representations of each degree of general unitary groups of degree 4 over principal ideal rings of length 2.

表示论 · 数学 2016-02-15 Matthew Levy

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

数论 · 数学 2013-08-23 Omran Ahmadi , Igor E. Shparlinski

In this paper, we construct a mixed-base number system over the generalized symmetric group $G(m,1,n)$, which is a complex reflection group with a root system of type $B_n^{(m)}$. We also establish one-to-one correspondence between all…

组合数学 · 数学 2023-05-09 Hasan Arslan , Alnour Altoum , Mariam Zaarour

We construct two bijections of the symmetric group S_n onto itself that enable us to show that three new three-variable statistics are equidistributed with classical statistics involving the number of fixed points. The first one is…

组合数学 · 数学 2007-05-23 Dominique Foata , Guo-Niu Han

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

表示论 · 数学 2007-05-23 G. Lusztig

We give a geometric description of a certain class of epimorphisms between complex reflection groups. We classify these epimorphisms, which can be interpreted as ``morphisms'' between the diagrams symbolizing standard presentations by…

群论 · 数学 2007-05-23 David Bessis , Cedric Bonnafe , Raphael Rouquier

Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…

组合数学 · 数学 2011-10-19 Nicolas Borie , Nicolas M. Thiéry

Answering a question of Geoff Robinson, we compute the large n limiting proportion of i(n,q)/q^[n^2/2], where i(n,q) denotes the number of involutions in GL(n,q). We give similar results for the finite unitary, symplectic, and orthogonal…

群论 · 数学 2017-02-24 Jason Fulman , Robert Guralnick , Dennis Stanton

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…

In this work we study representations of certain Coxeter groups to obtain some properties of the corresponding reflection groups.

群论 · 数学 2020-01-28 François Zara

Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…

数论 · 数学 2026-01-07 Chen Lin , Kaihan Tang

The present paper considers modified extension of the exponential distribution with three parameters. We study the main properties of this new distribution, with special emphasis on its median, mode and moments function and some…

其他统计学 · 统计学 2015-10-28 M. A. El-Damcese , Dina. A. Ramadan

The quantity $f(n,r)$, defined as the number of permutations of the set $[n]=\{1,2,... n\}$ whose fixed points sum to $r$, shows a sharp discontinuity in the neighborhood of $r=n$. We explain this discontinuity and study the possible…

组合数学 · 数学 2007-05-23 Edward A. Bender , E. Rodney Canfield , L. Bruce Richmond , Herbert S. Wilf

Baxter numbers are known to count several families of combinatorial objects, all of which come equipped with natural involutions. In this paper, we add a combinatorial family to the list, and show that the known bijections between these…

组合数学 · 数学 2014-02-13 Kevin Dilks

We prove the exponential growth of product replacement graphs for a large class of groups. Much of our effort is dedicated to the study of product replacement graphs of Grigorchuk groups, where the problem is most difficult.

群论 · 数学 2014-08-04 Anton Malyshev , Igor Pak

We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…

组合数学 · 数学 2014-09-15 Miklós Bóna , Cheyne Homberger , Jay Pantone , Vincent Vatter

Let $\{a_n(x)\}_{n\geq1}$ be the sequence of digits of $x\in(0,1)$ in infinite iterated function systems with polynomial decay of the derivative. We first study the multifractal spectrum of the convergence exponent defined by the sequence…

动力系统 · 数学 2025-01-16 Kunkun Song , Mengjie Zhang

We prove some general recursions for the numbers of representations of positive integers as a sum x+y, x in X, y in Y, where X,Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy,…

数论 · 数学 2013-07-16 Vladimir Shevelev

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

高能物理 - 理论 · 物理学 2009-10-31 P. Bantay

We compute the limiting distributions of the lengths of the longest monotone subsequences of random (signed) involutions with or without conditions on the number of fixed points (and negated points) as the sizes of the involutions tend to…

组合数学 · 数学 2007-05-23 Jinho Baik , Eric M. Rains