相关论文: Equivalences of LLT polynomials via lattice paths

We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander…

We discuss as a fundamental characteristic of orthogonal polynomials like the existence of a Lie algebra behind them, can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we put…

We introduce a Kauffman-Jones type polynomial $\mathcal{L}_{\gamma}(A)$ for a curve $\gamma$ on an oriented surface, whose endpoints are on the boundary of the surface. The polynomial $\mathcal{L}_{\gamma}(A)$ is a Laurent polynomial in one…

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

A linear isometry $R$ of $\mathbb{R}^d$ is called a similarity isometry of a lattice $\Gamma \subseteq \mathbb{R}^d$ if there exists a positive real number $\beta$ such that $\beta R\Gamma$ is a sublattice of (finite index in) $\Gamma$. The…

We exhibit algorithms for calculating Tits' buildings and orbits of vectors in a lattice $L$ for certain subgroups of $\operatorname{O}(L)$. We discuss how these algorithms can be applied to understand the configuration of boundary…

We propose a family of {\it local} $\cal{PT}$-symmetric photonic lattices with transverse index gradient $\omega$, where the emergence of {\it stable} Bloch-Zener oscillations are controlled by the degree of non-Hermiticity $\gamma$ of the…

We study classes $P_{g,T}(\alpha;\beta)$ on the moduli space of stable, genus g curves with rational tails defined by pushing forward the virtual fundamental classes of spaces of relative stable maps to an unparameterized projective line. A…

Orthogonal polynomials are of fundamental importance in many fields of mathematics and science, therefore the study of a particular family is always relevant. In this manuscript, we present a survey of some general results of the Hermite…

Let $\Gamma$ denote a finite, connected graph with vertex set $X$. Fix $x \in X$ and let $\varepsilon \ge 3$ denote the eccentricity of $x$. For mutually distinct scalars $\{\theta^*_i\}_{i=0}^\varepsilon$ define a diagonal matrix…

We study orthogonal polynomials and Hankel determinants generated by a symmetric semi-classical Jacobi weight. By using the ladder operator technique, we derive the second-order nonlinear difference equations satisfied by the recurrence…

We consider a \emph{family} $(P_\omega)_{\omega \in \Omega}$ of elliptic second order differential operators on a domain $U_0 \subset \mathbb{R}^m$ whose coefficients depend on the space variable $x \in U_0$ and on $\omega \in \Omega,$ a…

We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…

We study sets of univariate hyperbolic polynomials that share the same first few coefficients and show that they have a natural combinatorial description akin to that of polytopes. We define a stratification of such sets in terms of root…

We revisit the ladder operators for orthogonal polynomials and re-interpret two supplementary conditions as compatibility conditions of two linear over-determined systems; one involves the variation of the polynomials with respect to the…

The band structure of the Lam\'e equation, viewed as a one-dimensional Schr\"odinger equation with a periodic potential, is studied. At integer values of the degree parameter l, the dispersion relation is reduced to the l=1 dispersion…

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…

With a sufficiently fine discretisation, the Lattice Boltzmann Method (LBM) mimics a second order Crank-Nicolson scheme for certain types of balance laws (Farag et al. [2021]). This allows the explicit, highly parallelisable LBM to…

Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…

The $M$-polynomial of a graph $G$ is defined as $\sum_{i\le j} m_{i,j}(G)x^iy^j$, where $m_{i,j}(G)$, $i,j\ge 1$, is the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. Knowing the $M$-polynomial, formulas for bond…