相关论文: A new approach to constant term identities and Sel…
This work is in a stream initiated by a paper of Killip and Simon [Ann. of Math. (2003)]. Using methods of Functional Analysis and the classical Szeg\"o Theorem we prove sum rule identities in a very general form. Then, we apply the result…
We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…
We study the relation between certain non-degenerate lower Hessenberg infinite matrices $\mathcal{G}$ and the existence of sequences of orthogonal polynomials with respect to Sobolev inner products. In other words, we extend the well-known…
An asymptotic formula with a square root error term is obtained for the number of elements with given trace and norm in a finite semisimple algebra over a finite field. This extends previous results from finite etale algebras (commutative…
We study the fluctuations of certain biorthogonal ensembles for which the underlying family \{P,Q\} satisfies a finite-term recurrence relation of the form $x P(x) = \mathbf{J}P(x)$. For polynomial linear statistics of such ensembles, we…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…
For every variety of algebras over a field, there is a natural definition of a corresponding variety of dialgebras (Loday-type algebras). In particular, Lie dialgebras are equivalent to Leibniz algebras. We use an approach based on the…
An extension of Szemer\'edi's Theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and…
In 1985, Bressoud and Goulden derived the formula for the constant term in $\prod_{(i,j)\in T} \frac{x_j}{x_i}\\\prod_{0\le i<j \le n}(\frac{x_i}{x_j})_{a_i}(\frac{qx_j}{x_i})_{a_j-1}$, where $T \subseteq \{(i,j)\mid 0\le i<j \le n\}$. This…
In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…
Using the methods of classical invariant theory a general approach to finding of identities for Bernulli, Euler and Hermite polynomials is proposed.
Eisenstein series are ubiquitous in the theory of automorphic forms. The traditional proofs of the meromorphic continuation of Eisenstein series, due to Selberg and Langlands, start with cuspidal Eisenstein series as a special case, and…
As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevisky \cite{[4]}, in this paper, we give the test method of positive…
The relations between the Bernoulli and Eulerian polynomials of higher order and the complete Bell polynomials are found that lead to new identities for the Bernoulli and Eulerian polynomials and numbers of higher order. General form of…
As is known, every finite-dimensional algebra over a field is isomorphic to the centralizer algebra of \textbf{two} matrices. So it is fundamental to study first the centralizer algebra of a single matrix, called a centralizer matrix…
We construct big generalized Heegner classes by interpolating $p$-adically the generalized Heegner classes associated to quaternionic modular forms along a Coleman (finite slope) family, following the approach introduced by…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
We propose a novel combinatorial inference framework to conduct general uncertainty quantification in ranking problems. We consider the widely adopted Bradley-Terry-Luce (BTL) model, where each item is assigned a positive preference score…