Related papers: Partial Chebyshev Polynomials and Fan Graphs

We develop a diagrammatic categorification of the polynomial ring Z[x], based on a geometrically defined graded algebra. This construction generalizes to categorification of some special functions, such as Chebyshev polynomials.…

We call a set $\mathcal S$ of graphs an "even subdivison-factor" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $\mathcal…

This paper studies properties of the integer sequence $\overline{\overline{G}}_n=\prod_{k=0}^n\binom{n}{k}_{\mathbb{Z},\mathbb{N}}$ which is analogous to $\overline{G}_n=\prod_{k=0}^n\binom{n}{k}$, the product of the elements of the $n$-th…

This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…

The discrete Chebyshev polynomials $t_n(x,N)$ are orthogonal with respect to a distribution function, which is a step function with jumps one unit at the points $x=0,1,..., N-1$, N being a fixed positive integer. By using a double integral…

A new algebraic cubature formula of degree $2n+1$ for the product Chebyshev measure in the $d$-cube with $\approx n^d/2^{d-1}$ nodes is established. The new formula is then applied to polynomial hyperinterpolation of degree $n$ in three…

Let $K(\gamma)$ be the weakly equilibrium Cantor type set introduced in [10]. It is proven that the monic orthogonal polynomials $Q_{2^s}$ with respect to the equilibrium measure of $K(\gamma)$ coincide with the Chebyshev polynomials of the…

Using the recent result of Bourgain, Demeter and Guth on Vinogradov's mean value, a number of new results about small fractional parts of polynomials and fractional parts of additive forms are obtained. These improve work of Baker, Cook,…

A new, constructive proof with a small explicit constant is given to the Erd\H{o}s-Pyber theorem which says that the edges of a graph on $n$ vertices can be partitioned into complete bipartite subgraphs so that every vertex is covered at…

Using Chebyshev polynomials, we study the electronic transport properties of massless Dirac fermions in symmetrical graphene superlattice composed of three regions. Matching wavefunctions and using transfer matrix method, we explicitly…

We study generating functions for the number of permutations in $\SS_n$ subject to two restrictions. One of the restrictions belongs to $\SS_3$, while the other to $\SS_k$. It turns out that in a large variety of cases the answer can be…

For a pair of conjugate trigonometrical polynomials $C (t) = \sum_ { j = 1 } ^N { { a_j}\cos jt }, S(t) = \sum_ { j = 1 } ^N { { a_j}\sin jt }$ with real coefficients and normalization ${a_1} = 1 $ we solve the extremal problem \[ \sup_…

We derive optimal asymptotic and non-asymptotic lower bounds on the Widom factors for weighted Chebyshev and orthogonal polynomials on compact subsets of the real line. In the Chebyshev case we extend the optimal non-asymptotic lower bound…

A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on…

We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions $v,w$ -- biaxial double $(\beta,q)$-Grothendieck polynomials -- which specialize at $q=0$ and $v=1$ to double $\beta$-Grothendieck polynomials…

There is a natural notion of a subdivision of a lower Eulerian poset called a strong formal subdivision, which abstracts the notion of a polyhedral subdivision of a polytope, or a proper, surjective morphism of fans. We show that there is a…

Given a central division algebra $D$ of degree $d$ over a field $F$, we associate to any standard polynomial $\phi(z)=z^n+c_{n-1} z^{n-1}+\dots+c_0$ over $D$ a "companion polynomial" $\Phi(z)$ of degree $n d$ with coefficients in $F$ whose…

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…

We compute the quadratic embedding constant for complete bipartite graphs with disjoint edges removed. Moreover, we study the quadratic embedding property for theta graphs, i.e., graphs consisting of three paths with common initial points…

For $\textbf{r}=(r_1,\ldots,r_k)$, an $\textbf{r}$-factorization of the complete $\lambda$-fold $h$-uniform $n$-vertex hypergraph $\lambda K_n^h$ is a partition of the edges of $\lambda K_n^h$ into $F_1,\ldots, F_k$ such that $F_j$ is…