English
Related papers

Related papers: Extremal polynomials on a Jordan arc

200 papers

We show that for a typical high rank arithmetic lattice $\Gamma$, there exist finite index subgroups $\Gamma_{1}$ and $\Gamma_{2}$ such that $\Gamma_{1} \not\simeq \Gamma_{2}$ while $\widehat{\Gamma_{1}} \simeq \widehat{\Gamma_{2}}$. But…

Group Theory · Mathematics 2023-02-28 Amir Y. Weiss Behar

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…

Combinatorics · Mathematics 2014-08-01 M. Aaghabali , S. Akbari , S. Friedland , K. Markstrom , Z. Tajfirouz

We consider finite dimensional Jordan superalgebras $\jor$ over an algebraically closed field of characteristic 0, with solvable radical $\rad$ such that $\radd=0$ and $\jor/\rad$ is a simple Jordan superalgebra of one of the following…

Rings and Algebras · Mathematics 2017-09-26 F. A. Gómez-González

In this article, we develop a further adaptation of the method of Skjelbred-Sund to construct central extensions of axial algebras. We use our method to prove that all axial central extensions (with respect to a maximal set of axes) of…

Rings and Algebras · Mathematics 2022-11-02 Ivan Kaygorodov , Cándido Martín González , Pilar Páez-Guillán

An analogue of the Wedderbur principal theorem (WPT) is considered for finite dimensional Jordan superalgebras A with solvable radical N, such that N^2=0 and A/N is isomorphic to Josp_n|2m(F), where F is an algebraicallly closed field of…

Rings and Algebras · Mathematics 2017-10-02 F. A. Gómez González , R. Velásquez

The values of the determinant of Vandermonde matrices with real elements are analyzed both visually and analytically over the unit sphere in various dimensions. For three dimensions some generalized Vandermonde matrices are analyzed…

Classical Analysis and ODEs · Mathematics 2013-12-24 Karl Lundengård , Jonas Österberg , Sergei Silvestrov

We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…

Algebraic Geometry · Mathematics 2024-09-04 Boulos El Hilany , Sébastien Tavenas

Consider the Fourier expansions of two elements of a given space of modular forms. How many leading coefficients must agree in order to guarantee that the two expansions are the same? Sturm gave an upper bound for modular forms of a given…

Number Theory · Mathematics 2013-04-09 Sam Chow , Alexandru Ghitza

We give upper bounds on the Walsh coefficients of functions for which the derivative of order at least one has bounded variation of fractional order. Further, we also consider the Walsh coefficients of functions in periodic and non-periodic…

Functional Analysis · Mathematics 2013-04-04 Josef Dick

We obtain upper bounds for the Steklov eigenvalues of warped products $\Omega\times_h\Sigma$, where $\Omega$ is a compact Riemannian manifold with boundary and $\Sigma$ is a closed Riemannian manifold. These bounds involve the volume of…

Spectral Theory · Mathematics 2025-12-18 Jade Brisson , Bruno Colbois , Alexandre Girouard , Katie Gittins

The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We…

Group Theory · Mathematics 2026-02-11 Martin R. Bridson , Timothy R. Riley

Consider a fixed connected, finite graph $\Gamma$ and equip its vertices with weights $p_i$ which are non-negative integers. We show that there is a finite number of possibilities for the coefficients of the canonical cycle of a numerically…

Complex Variables · Mathematics 2009-09-15 Patrick Popescu-Pampu , Jose Seade

Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…

Combinatorics · Mathematics 2009-03-13 Reinhard Steffens , Thorsten Theobald

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

Metric Geometry · Mathematics 2015-09-28 P. G. Boyvalenkov , P. D. Dragnev , D. P. Hardin , E. B. Saff , M. M. Stoyanova

Let $\Omega \subset {\bf R}^d$ be a bounded open set with Lipschitz boundary $\Gamma$. It will be shown that the Jordan chains of m-sectorial second-order elliptic partial differential operators with measurable coefficients and (local or…

Spectral Theory · Mathematics 2019-05-30 J. Behrndt , A. F. M. ter Elst

This survey paper was primarily written as as the support for a course pesented at the JNCF2025: it aims to present some material that illustrates the kind of estimates one can obtain in effective algebraic geometry, for affine polynomial…

Algebraic Geometry · Mathematics 2026-01-19 Teresa Krick

In this paper, we present an alternative and elementary proof of a sharp version of the classical boundary Schwarz lemma by Frolova et al. with initial proof via analytic semigroup approach and Julia-Carath\'eodory theorem for univalent…

Complex Variables · Mathematics 2015-02-10 Guangbin Ren , Xieping Wang

Given a global field K and a polynomial f defined over K of degree at least two, Morton and Silverman conjectured in 1994 that the number of K-rational preperiodic points of f is bounded in terms of only the degree of K and the degree of f.…

Number Theory · Mathematics 2007-05-23 Robert L. Benedetto

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

Combinatorics · Mathematics 2022-12-06 Jie Ma , Tianchi Yang

For a graph $G$, let $\lambda_2(G)$ denote the second largest eigenvalue of the adjacency matrix of $G$. We determine the extremal trees with maximum/minimum adjacency eigenvalue $\lambda_2$ in the class $\mathcal{T}(n,d)$ of $n$-vertex…

Combinatorics · Mathematics 2024-09-04 Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada , Hanmeng Zhan