Related papers: A characterization of Q-polynomial association sch…
We prove that the super-linearizability of polynomial systems is preserved by all currently known classes of polynomial automorphisms of $\R^n$. We then establish connections between such automorphisms and a sufficient condition for…
An equivariant characteristic quasi-polynomial is a quasi-polynomial in $q$ consisting of the permutation character on the mod $q$ complement of the corresponding Coxeter arrangement. This concept is a refinement of the conventional…
In this paper, pursuing the same line of ideas in the proof of an old longstanding open conjecture of \emph{Kadison-Singer} , we introduce a key lemma which we call it the interlacing lemma which indicates a necessary condition for having a…
We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…
The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…
It follows from Delsarte theory that the Witt $4$-$(11,5,1)$ design gives rise to a $Q$-polynomial association scheme $\mathcal{W}$ defined on the set of its blocks. In this note we show that $\mathcal{W}$ is unique, i.e., defined up to…
It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…
A Q-system is a unitary version of a separable Frobenius algebra object in a C*-tensor category. In a recent joint work with P. Das, S. Ghosh and C. Jones, the author has categorified Bratteli diagrams and unitary connections by building a…
Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…
Necessary and sufficient conditions for the existence of a composite-system statistical operator, and, separately, for the possibility of its being correlated or uncorrelated, are derived in terms of its range dimension and the range…
Given a nonnegative integer $m$ and a finite collection ${\mathcal A}$ of linear forms on ${\mathbb Q}^d$, the arrangement of affine hyperplanes in ${\mathbb Q}^d$ defined by the equations $\alpha(x) = k$ for $\alpha \in {\mathcal A}$ and…
Making use of the method of subordination chains, we obtain some sufficient conditions for the univalence of an integral operator. In particular, as special cases, our results imply certain known univalence criteria. A refinement to a…
We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a generalization of authors' Rothification algorithm. Using the…
We introduce and study an inhomogeneous generalization of the spin $q$-Whittaker polynomials from [Borodin,Wheeler-17]. These are symmetric polynomials, and we prove a branching rule, skew dual and non-dual Cauchy identities, and an…
Modular pairs of some second order q-difference equations are considered. These equations may be interpreted as a quantum mechanics of a sort of hyperelliptic pendulum. It is shown the quantization of a spectrum may be provided by the…
The algebraic characterization of dual univariate interpolating subdivision schemes is investigated. Specifically, we provide a constructive approach for finding dual univariate interpolating subdivision schemes based on the solutions of…
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…
In this paper we explore the possibility of using computational algebraic methods to analyze a class of consensus protocols. We state some necessary conditions for convergence under consensus protocols that are polynomials.
The classical q-hypergeometric orthogonal polynomials are assembled into a hierarchy called the q-Askey scheme. At the top of the hierarchy, there are two closely related families, the Askey-Wilson and q-Racah polynomials. As it is well…
An infinite family of nonschurian separable association schemes is constructed.