Related papers: Chebyshev type lattice path weight polynomials by …
We study several related models of self-avoiding polygons in a tubular subgraph of the simple cubic lattice, with a particular interest in the asymptotics of the knotting statistics. Polygons in a tube can be characterised by a finite…
By addressing a long-standing open problem, listed in a highly regarded collection of open questions in the field and described as a "worthwhile research project", this note extends Markov's theorem (Markoff, Math. Ann., 27:177-182, 1886)…
One of the purposes in this paper is to provide a better understanding of the alternance property which occurs in Chebyshev polynomial approximation and piecewise polynomial approximation problems. In the first part of this paper, we…
We develop off-lattice simulations of semiflexible polymer chains subjected to applied mechanical forces using Markov Chain Monte Carlo. Our approach models the polymer as a chain of fixed-length bonds, with configurations updated through…
We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.
We construct a simple closed-form representation of degree-ordered system of bivariate Chebyshev-I orthogonal polynomials $\mathscr{T}_{n,r}(u,v,w)$ on simplicial domains. We show that these polynomials $\mathscr{T}_{n,r}(u,v,w),$…
Our main objective in this work is to show how Sobolev orthogonal polynomials emerge as a useful tool within the framework of spectral methods for boundary-value problems. The solution of a boundary-value problem for a stationary…
For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…
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…
Some 25 years ago Valiant introduced an algebraic model of computation in order to study the complexity of evaluating families of polynomials. The theory was introduced along with the complexity classes VP and VNP which are analogues of the…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
Ismail et al. (Constr. Approx. {\bf 15} (1999) 69--81) proved the positivity of some trigonometric polynomials with single binomial coefficients. In this paper, we prove some similar results by replacing the binomial coefficients with…
We present new stabilization terms for solving the linear transport equation on a cut cell mesh using the discontinuous Galerkin (DG) method in two dimensions with piecewise linear polynomials. The goal is to allow for explicit time…
An important set of theorems in geometric analysis consists of constant rank theorems for a wide variety of curvature problems. In this paper, for geometric curvature problems in compact and non-compact settings, we provide new proofs which…
We give a cohomological and geometrical interpretation for the weighted Ehrhart theory of a full-dimensional lattice polytope $P$, with Laurent polynomial weights of geometric origin. For this purpose, we calculate the motivic Chern and…
In this letter, we present a fast and well-conditioned spectral method based on the Chebyshev polynomials for computing the continuous part of the nonlinear Fourier spectrum. The algorithm achieves a complexity of $O(N_{\text{iter.}}N\log…
A simple convex lattice polytope $\Box$ defines a torus-equivariant line bundle $\LB$ over a toric variety $\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\LB$ and information…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We use localization to describe the restriction map from equivariant Chow cohomology to ordinary Chow cohomology for complete toric varieties in terms of piecewise polynomial functions and Minkowski weights. We compute examples showing that…
We present a complete solution to the so-called tennis ball problem, which is equivalent to counting lattice paths in the plane that use North and East steps and lie between certain boundaries. The solution takes the form of explicit…