Related papers: Bipartite Chebyshev polynomials and elliptic integ…
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.
Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. For all $s \geq 1$, we obtain upper bounds for reg$(I(G)^s)$ for bipartite graphs. We then compare the properties of $G$ and $G'$, where $G'$ is the graph…
In this work, considering a general subclass of bi-univalent functions and using the Chebyshev polynomials, we obtain coefficient expansions for functions in this class.
The interior polynomial and the exterior polynomial are generalizations of valuations on $(1/\xi,1)$ and $(1,1/\eta)$ of the Tutte polynomial $T_G(x,y)$ of graphs to hypergraphs, respectively. The pair of hypergraphs induced by a connected…
In this paper we determine all the bipartite graphs with the maximum sum of squares of degrees among the ones with a given number of vertices and edges.
Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with…
Consider two graphs G_1 and G_2 on the same vertex set V and suppose that G_i has m_i edges. Then there is a bipartition of V into two classes A and B so that for both i=1,2 the number of edges between A and B in G_i is (1+o(1))m_i/2. This…
We consider the complex Elliptic Ginibre Ensemble, a family of random matrix models introduced by Girko that interpolates between the Ginibre Ensemble and the Gaussian Unitary Ensemble and such that its empirical spectral measure converges…
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.
We study weighted Chebyshev polynomials on compact subsets of the complex plane with respect to a bounded weight function. We establish existence and uniqueness of weighted Chebyshev polynomials and derive weighted analogs of Kolmogorov's…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
A graph $G=(V,E)$ is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite $1$-planar graphs with prescribed numbers of vertices in partite sets. Bipartite…
Let $P(b)\subset R^d$ be a semi-rational parametric polytope, where $b=(b_j)\in R^N$ is a real multi-parameter. We study intermediate sums of polynomial functions $h(x)$ on $P(b)$, $$ S^L (P(b),h)=\sum_{y}\int_{P(b)\cap (y+L)} h(x) \mathrm…
We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…
We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and…
Our objective in this paper is to introduce and investigate a newly-constructed subclass of normalized analytic and bi-univalent functions by means of the Chebyshev polynomials of the second kind. Upper bounds for the second and third…
A polynomial with exactly two critical values is called a generalized Chebyshev polynomial. A polynomial with exactly three critical values is called a Zolotarev polynomial. Two Chebyshev polynomials $f$ and $g$ are called Z-homotopic, if…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…