Related papers: The Graph Structure of Chebyshev Polynomials over …
One parameter subgroups of the group of hyperbolons of volume one when exploited accurately allow one to define and investigate higher order hyperbolic-trigonometric generalization of corresponding polynomials. In parallel functions of…
Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
The Chebyshev polynomials are utilized in this study to define the subclass of the bi-univalent function. Also, Chebyshev polynomial bounds and Fekete-Szego inequalities for functions defined in the classes are established.
The objective of this paper is to describe the structure of Zariski closed algebras, which provide a useful generalization to finite dimensional algebras in the study of representable algebras over finite fields. Our results include a…
Jones and Boston conjectured that the factorization process for iterates of irreducible quadratic polynomials over finite fields is approximated by a Markov model. In this paper, we find unexpected and intricate behavior for some quadratic…
A general formula is presented for any order derivative of Chebyshev polynomials instead of the existing recursive relationship. Hence, the Chebyshev finite difference method is made applicable not only to second order problems but also to…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the `kneading sequence' of the polynomial. We then give recursive presentations by generators and…
A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $\Gamma=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq…
After fixing a triangulation $L$ of a $k$-dimensional simplex that has no new vertices on the boundary, we introduce a triangulation operation on all simplicial complexes that replaces every $k$-face with a copy of $L$, via a sequence of…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
The purpose of this paper is to extend the scope of the Ehrhart theory to periodic graphs. We give sufficient conditions for the growth sequences of periodic graphs to be a quasi-polynomial and to satisfy the reciprocity laws. Furthermore,…
We begin by considering a sequence of polynomials in three variables whose coefficients count restricted binary overpartitions with certain properties. We then concentrate on two specific subsequences that are closely related to the…
In this paper we compute the Reduced Fox Coloring Group of the diagrams of Wheel Graphs which can also be represented at the closure of the braids $(\sigma_1 \sigma_2^{-1})^n$. In doing so, we utilize Fibonacci numbers and their properties.…
In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer…