Related papers: Semi-analytical solutions for eigenvalue problems …
Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general…
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…
We consider the eigenvalue problem for one-dimensional linear Schr\"odinger lattices (tight-binding) with an embedded few-sites linear or nonlinear, Hamiltonian or non-conservative defect (an oligomer). Such a problem arises when…
We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…
We consider the family of polynomials $p_{n}\left( x;z\right) ,$ orthogonal with respect to the inner product \[ \left\langle f,g\right\rangle = \int_{-z}^{z} f\left( x\right) g\left( x\right) e^{-x^{2}} \,dx. \] We show some properties…
We present two algorithms for constructing orthonormal bases of rational function vectors with respect to a discrete inner product, and discuss how to use them for a rational approximation problem. Building on the pencil-based formulation…
We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie…
Trigonometric polynomials are usually defined on the lattice of integers.We consider the larger class of weight and root lattices with crystallographic symmetry.This article gives a new approach to minimize trigonometric polynomials, which…
We present a polynomial basis that exactly tridiagonalizes Teukolsky's radial equation for quasi-normal modes. These polynomials naturally emerge from the radial problem, and they are canonical in that they possess key features of classical…
We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…
Semi-analytical methods for the modeling of guided waves in structures of constant cross-section lead to frequency-dependent polynomial eigenvalue problems for the wavenumbers and mode shapes. Solving these eigenvalue problems for a range…
In this paper, we propose a unified approach for solving structure-preserving eigenvalue embedding problem (SEEP) for quadratic regular matrix polynomials with symmetry structures. First, we determine perturbations of a quadratic matrix…
The numerical solution of the generalized eigenvalue problem for a singular matrix pencil is challenging due to the discontinuity of its eigenvalues. Classically, such problems are addressed by first extracting the regular part through the…
The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…
In this paper we present a complete method for finding the roots of all polynomials of the form $\phi(z)=c_n z^n+c_{n-1} z^{n-1}+\dots+c_1 z+c_0$ over a given octonion division algebra. When $\phi(z)$ is monic we also consider the companion…
We give polynomial-time approximation schemes for monotone maximization problems expressible in terms of distances (up to a fixed upper bound) and efficiently solvable in graphs of bounded treewidth. These schemes apply in all fractionally…
In this article explicit formulas for the recurrence equation p_{n+1}(x) = (A_n x + B_n) p_n(x) - C_n p_{n-1}(x) and the derivative rules sigma(x) p'_n(x) = alpha_n p_{n+1}(x) + beta_n p_n(x) + gamma_n p_{n-1}(x) and sigma(x) p'_n(x) =…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…
The desired shifts of the boundaries of spectral allowed zones of periodical systems are demonstrated. In particular, the phenomenon of merging neighbor allowed zones is exhibited and its simple explanation is given. It is also shown how to…