English
Related papers

Related papers: Bipartite Chebyshev polynomials and elliptic integ…

200 papers

In this work, we study superconvergence properties for some high-order orthogonal polynomial interpolations.The results are two-folds: When interpolating function values, we identify those points where the first and second derivatives of…

Numerical Analysis · Mathematics 2012-04-27 Zhimin Zhang

For a function that is analytic on and around an interval, Chebyshev polynomial interpolation provides spectral convergence. However, if the function has a singularity close to the interval, the rate of convergence is near one. In these…

Numerical Analysis · Mathematics 2017-08-10 Kevin W. Aiton , Tobin A. Driscoll

In this paper we describe the intersection between the balls of maximal symplectic packings of $\P^2$. This analysis shows the existence of singular points for maximal packings of $\P^2$ by more than three equal balls. It also yields a…

Symplectic Geometry · Mathematics 2007-05-23 Emmanuel Opshtein

Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative polynomial approximation algorithms to…

Signal Processing · Electrical Eng. & Systems 2025-04-22 Cheng Cheng , Qiyu Sun , Cong Zheng

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

Complex Variables · Mathematics 2013-03-19 J. H. Pan , Roderick Wong

Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…

Let G be a finite group and A a finite dimensional G-graded algebra over a field of characteristic zero. When A is simple as a G-graded algebra, by mean of Regev central polynomials we construct multialternating graded polynomials of…

Rings and Algebras · Mathematics 2012-04-17 Eli Aljadeff , Antonio Giambruno

Given a graph $G$, two edges $e_{1},e_{2}\in E(G)$ are said to have a common edge $e$ if $e$ joins an endvertex of $e_{1}$ to an endvertex of $e_{2}$. A subset $B\subseteq E(G)$ is an edge open packing set in $G$ if no two edges of $B$ have…

Combinatorics · Mathematics 2024-03-04 Boštjan Brešar , Babak Samadi

Let $G$ be a simple graph with order $n$ and adjacency matrix $\mathbf{A}(G)$. Let $\phi(G; \lambda)=\det(\lambda I-\mathbf{A}(G))=\sum_{i=0}^n\mathbf{a}_i(G)\lambda^{n-i}$ be the characteristic polynomial of $G$, where $\mathbf{a}_i(G)$ is…

Combinatorics · Mathematics 2020-02-11 Shi Cai Gong , Shao Wei Sun

The higher derivatives of the tangent and hyperbolic tangent functions are determined. Formulas for the higher derivatives of the inverse tangent and inverse hyperbolic tangent functions as polynomials are stated and proved. Using another…

General Mathematics · Mathematics 2023-01-18 M. J. Kronenburg

In the previous paper, we showed that the Riley polynomial $\mathcal{R}_K(\lambda)$ of each 2-bridge knot $K$ is split into $\mathcal{R}_K(-u^2)=\pm g(u)g(-u)$, for some integral coefficient polynomial $g(u)\in \mathbb Z[u]$. In this paper,…

Geometric Topology · Mathematics 2022-07-28 Kyeonghee Jo , Hyuk Kim

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…

Numerical Analysis · Mathematics 2016-09-15 Soner Aydinlik , Ahmet Kiris

The interactions inside the (bisemi)particles are envisaged from two points of view: The first approach, based on the reducible representations of algebraic bilinear semigroups, allows to describe explicitly the interactions between…

General Physics · Physics 2007-05-23 Christian Pierre

The local complement G*i of a simple graph G at one of its vertices i is obtained by complementing the subgraph induced by the neighborhood of i and leaving the rest of the graph unchanged. If e={i,j} is an edge of G then G*e=((G*i)*j)*i is…

Combinatorics · Mathematics 2007-05-23 Maarten Van den Nest , Bart De Moor

Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…

Symbolic Computation · Computer Science 2016-05-10 Mohab Safey El Din , Pierre-Jean Spaenlehauer

In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric graphs like unit distance graphs on convex point sets. In the…

Computational Geometry · Computer Science 2013-12-10 Abhijeet Khopkar , Sathish Govindrajan

The \emph{Antimagic Graph Conjecture} asserts that every connected graph $G = (V, E)$ except $K_2$ admits an edge labeling such that each label $1, 2, ..., |E|$ is used exactly once and the sums of the labels on all edges incident with a…

Combinatorics · Mathematics 2013-10-07 Matthias Beck , Michael Jackanich

For $N \in \mathbb{N}$, let $T_{N}$ be the Chebyshev polynomial of the first kind. Expressions for the sequence of numbers $p_{\ell}^{(N)}$, defined as the coefficients in the expansion of $1/T_{N}(1/z)$, are provided. These coefficients…

Probability · Mathematics 2014-02-03 Lin Jiu , Victor H. Moll , C. Vignat

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

Number Theory · Mathematics 2023-06-06 Riccardo Invernizzi , Daniele Taufer

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

Group Theory · Mathematics 2018-09-28 Zeinab Akhlaghi , Carlo Casolo , Silvio Dolfi , Emanuele Pacifici , Lucia Sanus