Related papers: Constructive Method for Finding the Coefficients o…
This article studies the inhomogeneous geometric polynuclear growth model, the distribution of which is related to Schur functions. We explain a method to derive its distribution functions in both space-like and time-like directions,…
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
Let $(G,G_1)$ be a symmetric pair of holomorphic type, and we consider a pair of Hermitian symmetric spaces $D_1=G_1/K_1\subset D=G/K$, realized as bounded symmetric domains in complex vector spaces $\mathfrak{p}^+_1\subset\mathfrak{p}^+$…
We study asymptotics of perfect matchings on a large class of graphs called the contracting square-hexagon lattice, which is constructed row by row from either a row of a square grid or a row of a hexagonal lattice. We assign the graph…
We provide a formula for every Schur coefficient in the chromatic symmetric function of a graph in terms of special rim hook tabloids. This formula is useful in confirming the non-Schur positivity of the chromatic symmetric function of a…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
The purpose of the present paper is to investigate some structural and qualitative aspects of two different perturbations of the parameters of $g$-fractions. In this context the concept of \emph{gap} $g$-fractions is introduced. While tail…
Denote the Laplacian of a graph $G$ by $L(G)$ and its second smallest Laplacian eigenvalue by $\lambda_2(G)$. If $G$ is a graph on $n\ge 2$ vertices, then it is shown that the second smallest eigenvalue of $L(G) + \frac{1}{n}…
The classic graphical Cheeger inequalities state that if $M$ is an $n\times n$ symmetric doubly stochastic matrix, then \[ \frac{1-\lambda_{2}(M)}{2}\leq\phi(M)\leq\sqrt{2\cdot(1-\lambda_{2}(M))} \] where…
This paper outlines a methodology for constructing a geometrically smooth interpolatory curve in $\mathbb{R}^d$ applicable to oriented and flattenable points with $d\ge 2$. The construction involves four essential components: local…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
We study total and partial supersymmetry breaking by freely acting orbifolds, or equivalently by Scherk-Schwarz compactifications, in type I string theory. In particular, we describe a four-dimensional chiral compactification with…
An algebraic approximation, of order $K$, of a polyhedron correlation function (CF) can be obtained from $\gamma\pp(r)$, its chord-length distribution (CLD), considering first, within the subinterval $[D_{i-1},\, D_i]$ of the full range of…
A method of classification of integrable equations on quad-graphs is discussed based on algebraic ideas. We assign a Lie ring to the equation and study the function describing the dimensions of linear spaces spanned by multiple commutators…
The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type $A$ by a Schur function, which we refer to as Schubert vs. Schur problem, can be understood from the multiplication in the space of…
We obtain a pair of second order differential equations in two variables $x$ and $t$ from the coupled DGLAP QCD evolution equations at small $x$ using the standard Taylor series expansion method.To that end we keep terms upto $O(x^2 )$.We…
Let $r \geq 0$, and let $\lambda$ and $\mu$ be partitions such that $\lambda_1 \leq r + 1$. We present a combinatorial interpretation of the plethysm coefficient $\langle s_\lambda, s_\mu[s_r] \rangle$. As a consequence, we solve the…
Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if $G$ is an…
This paper introduces a new shape-matching methodology, combinative matching, to combine interlocking parts for geometric shape assembly. Previous methods for geometric assembly typically rely on aligning parts by finding identical surfaces…
Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…