Related papers: Chebyshev type lattice path weight polynomials by …
Let $E$ be a homogeneous compact set, for instance a Cantor set of positive length. Further let $\sigma$ be a positive measure with $\text{supp}(\sigma)=E$. Under the condition that the absolutely continuous part of $\sigma$ satisfies a…
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
We prove an analogue of Chebyshev's alternation theorem for linearly independent discrete functions $\Phi_n=\{\varphi_k\}_{k=1}^n$ on the interval $[0,q]_{\mathbb{Z}}=[0,q]\cap \mathbb{Z}$. In particular, we establish that the polynomial of…
The Longest Path Problem is a question of finding the maximum length between pairs of vertices of a graph. In the general case, the problem is NP-complete. However, there is a small collection of graph classes for which there exists an…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…
In this paper we formulate and analyze a Discontinuous Petrov Galerkin formulation of linear transport equations with variable convection fields. We show that a corresponding {\em infinite dimensional} mesh-dependent variational…
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…
Given a bivariate weight function defined on the positive quadrant of $\mathbb{R}^2$, we study polynomials in two variables orthogonal with respect to varying measures obtained by special modifications of this weight function. In…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
The theory of persistence modules on the commutative ladders $CL_n(\tau)$ provides an extension of persistent homology. However, an efficient algorithm to compute the generalized persistence diagrams is still lacking. In this work, we view…
In this paper, we describe a class of elements in the ring of $\mathrm{SL}(V)$-invariant polynomial functions on the space of configurations of vectors and linear forms of a 3-dimensional vector space $V.$ These elements are related to one…
We consider the Shortest Odd Path problem, where given an undirected graph $G$, a weight function on its edges, and two vertices $s$ and $t$ in $G$, the aim is to find an $(s,t)$-path with odd length and, among all such paths, of minimum…
We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.
We give a uniform interpretation of the classical continuous Chebyshev's and Hahn's orthogonal polynomials of discrete variable in terms of Feigin's Lie algebra gl(N), where N is any complex number. One can similarly interpret Chebyshev's…
We consider a system of nonlinear equations that extends the Maxwell theory. It was pointed out in a previous paper that symmetric solutions of these equations display properties characteristic of magnetic oscillations. In this paper I…
We develop a unified construction of matrix-valued orthogonal polynomials associated with discrete weights, yielding bispectral sequences as eigenfunctions of second-order difference operators. This general framework extends the discrete…
In this thesis we develop generalized versions of the Chung-Feller theorem for lattice paths constrained in the half plane. The beautiful cycle method which was developed by Devoretzky and Motzkin as a means to prove the ballot problem is…
We consider a class of fixed-charge transportation problems over graphs. We show that this problem is strongly NP-hard, but solvable in pseudo-polynomial time over trees using dynamic programming. We also show that the LP formulation…
In 1977, Yu. V. Matiyasevich proposed a formula expressing the chromatic polynomial of an arbitrary graph as a linear combination of flow polynomials of subgraphs of the original graph. In this paper, we prove that this representation is a…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…