Related papers: Weighted Lattice Paths Enumeration by Gaussian Pol…
We introduce and study a one-parameter generalization of the q-Whittaker symmetric functions. This is a family of multivariate symmetric polynomials, whose construction may be viewed as an application of the procedure of fusion from…
According to loop quantum gravity, matter fields must be quantized in a background independent manner. For scalar fields, such a background independent quantization is called polymer quantization and is inequivalent to the standard…
Denote by $x$ a random infinite path in the graph of Pascal's triangle (left and right turns are selected independently with fixed probabilities) and by $d_n(x)$ the binomial coefficient at the $n$'th level along the path $x$. Then for a…
We consider a generalized Gauss sum supported on matrices over a number field. We evaluate this Gauss sum and relate it to the number of totally isotropic subspaces of related quadratic spaces. Then we consider a further generalization of…
Although the Hamiltonian formalism is so far favored for quantum computation of lattice gauge theory, the path integral formalism would never be useless. The advantages of the path integral formalism are the knowledge and experience…
It is known that Bernoulli scheme of independent trials with two outcomes is connected with the binomial coefficients. The aim of this paper is to indicate stochastic processes which are connected with the $q$-polynomial coefficients (in…
We provide two new characterizations of bounded orthogonally additive polynomials from a uniformly complete vector lattice into a convex bornological space using separately two polynomial identities of Kusraeva involving the root mean power…
We describe in this note a new invariant of rooted trees. We argue that the invariant is interesting on it own, and that it has connections to knot theory and homological algebra. However, the real reason that we propose this invariant to…
We study a combinatorial model of the quantum scalar field with polynomial potential on a graph. In the first quantization formalism, the value of a Feynman graph is given by a sum over maps from the Feynman graph to the spacetime graph…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
We explore an identity between two branching graphs and propose a physical meaning in the context of the gauge-gravity correspondence. From the mathematical point of view, the identity equates probabilities associated with $\mathbb{GT}$,…
Applications of the Path Group (consisting of classes of continuous curves in Minkowski space-time) to gauge theory and gravity are reviewed. Covariant derivatives are interpreted as generators of an induced representation of Path Group.…
Permutation tableaux are combinatorial objects related with permutations and various statistics on them. They appeared in connection with total positivity in Grassmannians, and stationary probabilities in a PASEP model. In particular they…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
We establish an alternative, ``perpendicular" collection of generating functions for the coefficients of Gaussian polynomials, $\begin{bmatrix}N+m\\m\end{bmatrix}_q$. We provide a general characterization of these perpendicular generating…
Admissable weight is an important tool for studying spectral invariance in operator algebra. Common admissable weights include polynomial weights and sub exponential weights. This article mainly provides a proof that polynomial weights are…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
We give an expression of the $q$-analogues of the multiplicities of weights in irreducible $\sl_{n+1}$-modules in terms of the geometry of the crystal graph attached to the corresponding $U_q(\sl_{n+1})$-modules. As an application, we…