Related papers: The Graph Structure of Chebyshev Polynomials over …
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…
We present a method to determine the impurity Greens function of the interacting resonant level model (IRLM) using numerical simulation techniques based on the expansion of a resolvent expression in terms of Chebyshev polynomials. The…
We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
We survey the construction and properties of the Yamada polynomial of spatial graphs and present the Yamada polynomial formulae for some classes of graphs. Then we construct an infinite family of spatial graphs for which roots of Yamada…
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
A Chebyshev curve C(a,b,c,\phi) has a parametrization of the form x(t)=Ta(t); y(t)=T_b(t) ; z(t)= Tc(t + \phi), where a,b,c are integers, Tn(t) is the Chebyshev polynomial of degree n and \phi \in \RR. When C(a,b,c,\phi) has no double…
We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
Some results on the approximation of functions from the Sobolev spaces on metric graphs by step functions are obtained. The estimates are uniform with respect to all graphs of a given finite length, and the constant factors in the…
Extended Chebyshev spaces that also comprise the constants represent large families of functions that can be used in real-life modeling or engineering applications that also involve important (e.g. transcendental) integral or rational…
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…
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an…
By using sheaf-theoretical methods such as constructible sheaves, we generalize the formula of Libgober-Sperber concerning the zeta functions of monodromy at infinity of polynomial maps into various directions. In particular, some formulas…
This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform…
We survey the use of Chebyshev polynomials and Toeplitz theory for studying topological metamaterials. We consider both Hermitian and non-Hermitian systems of subwavelength resonators and provide a mathematical framework to explain some…
Previously, the graph permanent was introduced as a single-valued invariant for graphs $G$ with $|E(G)| = k(|V(G)|-1)$ for some $k \in \mathbb{Z}_{>0}$. Herein, we construct the extended graph permanent, an infinite sequence for all graphs.…
A Lefschetz formula is given that relates loops in a regular finite graph to traces of a certain representation. As an application the poles of the Ihara/Bass zeta function are expressed as dimensions of global section spaces of locally…
We present new convergence estimates of generalized empirical interpolation methods in terms of the entropy numbers of the parametrized function class. Our analysis is transparent and leads to sharper convergence rates than the classical…