English
Related papers

Related papers: Barycentric subdivisions and derangement polynomia…

200 papers

In this paper we study the generating polynomials obtained by enumerating signed simsun permutations by number of the descents. Properties of the polynomials, including the recurrence relations and generating functions are studied.

Combinatorics · Mathematics 2016-05-18 Shi-Mei Ma , Toufik Mansour , Hai-Na Wang

We give a bijection between meanders and special sorts of Gauss diagrams which aroused from the Thurston generators of braid groups. It allows us to give an algorithm to construct such diagrams and to code meanders by matrices which are…

Algebraic Topology · Mathematics 2024-10-10 Viktor Lopatkin

Explicit generators are given for the ring of invariant polynomials under the coadjoint representation of certain inhomogeneous groups.

Representation Theory · Mathematics 2009-03-31 Mustapha Raïs

The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…

Representation Theory · Mathematics 2024-05-22 Mozhgan Mohammadpour , Shayne Waldron

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

The alternating-runs polynomial enumerates alternating runs in the symmetric group. There are three formulae for the number of permutations, $R_{n,k}$ in $\mathfrak{S}_n$ with $k$ alternating runs, but all of them are complicated. We show…

Combinatorics · Mathematics 2020-10-20 Hiranya Kishore Dey , Sivaramakrishnan Sivasubramanian

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

We obtain strong converse inequalities for the Bernstein polynomials with explicit asymptotic constants. We give different estimation procedures in the central and non-central regions of [0,1]. The main ingredients in our approach are the…

Classical Analysis and ODEs · Mathematics 2024-09-06 José A. Adell , Daniel Cárdenas-Morales

Let $G$ be a subgroup of the symmetric group $S_n$. If the proportion of fixed-point-free elements in $G$ (or a coset) equals the proportion of fixed-point-free elements in $S_n$, then $G=S_n$. The analogue for $A_n$ holds if $n \ge 7$. We…

Group Theory · Mathematics 2024-06-04 Bjorn Poonen , Kaloyan Slavov

A signed permutation \pi = \pi_1\pi_2 \ldots \pi_n in the hyperoctahedral group B_n is a word such that each \pi_i \in {-n, \ldots, -1, 1, \ldots, n} and {|\pi_1|, |\pi_2|, \ldots, |\pi_n|} = {1,2,\ldots,n}. An index i is a peak of \pi if…

Combinatorics · Mathematics 2013-09-02 Francis Castro-Velez , Alexander Diaz-Lopez , Rosa Orellana , Jose Pastrana , Rita Zevallos

Let $S_n$ denote a symmetric group, $\chi$ an irreducible character of $S_n$, and $g\in S_n$ an element which decomposes into $k$ disjoint cycles, where $1$-cycles are included. Then $|\chi(g)|\le k!$, and this upper bound is sharp for…

Representation Theory · Mathematics 2024-11-14 Michael Larsen

Any homogeneous harmonic polynomial can be decomposed as a sum of powers of isotropic linear forms, that is, linear forms whose coefficients are the coordinates of isotropic points. The minimum size of such decompositions for a harmonic…

Algebraic Geometry · Mathematics 2025-12-08 S. Canino , C. Flavi

The polynomial Szemer\'{e}di theorem implies that, for any $\delta \in (0,1)$, any family $\{P_1,\ldots, P_m\} \subset \mathbb{Z}[y]$ of nonconstant polynomials with constant term zero, and any sufficiently large $N$, every subset of…

Combinatorics · Mathematics 2025-03-21 Vitaly Bergelson , Andrew Best

Let n>0 be an integer and let B_{n} denote the hyperoctahedral group of rank n. The group B_{n} acts on the polynomial ring Q[x_{1},...,x_{n},y_{1},...,y_{n}] by signed permutations simultaneously on both of the sets of variables…

Combinatorics · Mathematics 2013-03-21 José Manuel Gómez

We compute Ext-groups between classical exponential functors (i.e. symmetric, exterior or divided powers) and their Frobenius twists. Our method relies on bar constructions, and bridges these Ext-groups with the homology of Eilenberg-Mac…

Representation Theory · Mathematics 2013-09-10 Antoine Touzé

In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly…

Combinatorics · Mathematics 2010-05-20 Masato Kobayashi

We prove a family of identities, expressing generating functions of powers of characteristic polynomials of permutations, as finite or infinite products. These generalize formulae first obtained in a study of the geometry/topology of…

Combinatorics · Mathematics 2021-10-19 Carlos A. A. Florentino

In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

It is proved that a certain symmetric sequence of nonnegative integers arising in the enumeration of magic squares of given size n by row sums or, equivalently, in the generating function of the Ehrhart polynomial of the polytope of doubly…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis

We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…

Computational Complexity · Computer Science 2022-12-02 Edinah K. Gnang , Rongyu Xu
‹ Prev 1 8 9 10 Next ›