English
Related papers

Related papers: Quasi-Stirling Polynomials on Multisets

200 papers

Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture…

Discrete Mathematics · Computer Science 2016-06-28 Jean-Luc Baril , Vincent Vajnovszki

Using Reiner's definition of Stirling numbers of the second kind in types $B$ and $D$, we generalize two well-known identities concerning the classical Stirling numbers of the second kind. The first identity relates them with Eulerian…

Combinatorics · Mathematics 2019-11-27 Eli Bagno , Riccardo Biagioli , David Garber

A half-integral polygon with quasi-period collapse behaves similarly to a lattice polygon in the sense that the number of lattice points in its integer dilates can be calculated as values of a polynomial, its Ehrhart polynomial. As a main…

Combinatorics · Mathematics 2025-07-03 Martin Bohnert

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Combinatorics · Mathematics 2021-01-05 Arvind Ayyer , Daniel Hathcock , Prasad Tetali

A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. In this paper we show that every quasiconformal tree bi-Lipschitz embeds in some…

Metric Geometry · Mathematics 2021-06-25 Guy C. David , Sylvester Eriksson-Bique , Vyron Vellis

A stationary subdivision scheme generates the full space of polynomials of degree up to $k$ if and only if its mask satisfies sum rules of order $k+1$, or its symbol satisfies zero conditions of order $k+1$. This property is often called…

Numerical Analysis · Mathematics 2012-02-20 Maria Charina , Costanza Conti

The aim of this work is to extend the study of super-coinvariant polynomials, to the case of the generalized symmetric group $G_{n,m}$, defined as the wreath product $C_m\wr\S_n$ of the symmetric group by the cyclic group. We define a…

Combinatorics · Mathematics 2007-11-07 Jean-Christophe Aval

Let $\mathbb{F}_q$ be the finite field of $q$ elements. Then a \emph{permutation polynomial} (PP) of $\mathbb{F}_q$ is a polynomial $f \in \mathbb{F}_q[x]$ such that the associated function $c \mapsto f(c)$ is a permutation of the elements…

Number Theory · Mathematics 2012-11-27 Christopher J. Shallue

In this paper, we consider Hermite and poly-Bernoulli mixed-type polynomials and investigate the properties of those polynomials which are derived from umbral calculus. Finally, we give various identities associated with Stirling numbers,…

Number Theory · Mathematics 2013-10-07 Dae san Kim , taekyun Kim

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

The P-Eulerian polynomial counts the linear extensions of a labeled partially ordered set, P, by their number of descents. It is known that the P-Eulerian polynomials are real-rooted for various classes of posets P. The purpose of this…

Combinatorics · Mathematics 2016-04-15 Petter Brändén , Madeleine Leander

A characteristic polynomial is an important invariant in the field of hyperplane arrangement. For the Linial arrangement of any irreducible root system, Postnikov and Stanley conjectured that all roots of the characteristic polynomial have…

Combinatorics · Mathematics 2020-12-11 Shigetaro Tamura

Mendes recently conjectured an identity simplifying the Poincar\'e series of the space of equivariant polynomial maps from $\mathbb{R}^{n}$ to a subrepresentation of $Sym^{2}(\mathbb{R}^{n})$. We show how to prove this identity using a…

Combinatorics · Mathematics 2010-11-12 Paul Levande

Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this…

Populations and Evolution · Quantitative Biology 2022-04-06 Joan Carles Pons , Tomás M. Coronado , Michael Hendriksen , Andrew Francis

We obtain closed form expressions for convolutions of scale transformations within a certain subset of Appell polynomials. This subset contains the Bernoulli, Apostol-Euler, and Cauchy polynomials, as well as various kinds of their…

Number Theory · Mathematics 2018-05-14 José A. Adell , Alberto Lekuona

Explicit expression for quasi-triviality of scalar non-linear PDE is under consideration.

Mathematical Physics · Physics 2020-03-31 Boris Dubrovin , Di Yang

Let $e^{2\pi i\Q}$ denote the set of roots of unity. We consider subsets $E\subset e^{2\pi i\Q}$ that are quasi-independent or algebraically independent (as subsets of the discrete plane). A bijective map on $e^{2\pi i\Q}$ preserves the…

Functional Analysis · Mathematics 2007-05-23 L. Thomas Ramsey , Colin C. Graham

Motivated by recent work on (re)mixed Eulerian numbers, we provide a combinatorial interpretation of a subfamily of the remixed Eulerian numbers introduced by Nadeau and Tewari. More specifically, we show that these numbers can be realized…

Combinatorics · Mathematics 2025-09-03 Chao Xu , Jiang Zeng

A real matrix $Q$ is quasi-orthogonal if $Q^{\top}Q=qI$, for some positive real number $q$. We prove that any $n\times n$ skew-symmetric matrix $S$ is a principal sub-matrix of a skew-symmetric quasi-orthogonal matrix $Q$, called a…

Combinatorics · Mathematics 2024-10-28 Abderrahim Boussaïri , Brahim Chergui , Zaineb Sarir , Mohamed Zouagui

Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…

Symbolic Computation · Computer Science 2007-05-23 Martin Ziegler