English
Related papers

Related papers: Tricomplex dynamical systems generated by polynomi…

200 papers

We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…

Classical Analysis and ODEs · Mathematics 2007-12-18 Alexei Zhedanov

We consider the class of {\em separable} $k$-hypergraphs, which can be viewed as uniform analogs of threshold Boolean functions, and the class of {\em equatable} $k$-hypergraphs. We show that every $k$-hypergraph is either separable or…

Optimization and Control · Mathematics 2023-03-23 Daniel Deza , Shmuel Onn

A complex polynomial $P(z) = c_0 + c_1 z +...+ c_n z^n$ is called unimodular if $|c_j| = 1$, $j = 0,...,n$. Littlewood asked the question (1966) on how close a unimodular polynomial come to satisfying $|P(z)| \approx \sqrt{n+1}$ if $n \ge…

Dynamical Systems · Mathematics 2010-02-16 A. A. Prikhod'ko

In hep-th/9805025, a result for the symmetric 3-loop massive tetrahedron in 3 dimensions was found, using the lattice algorithm PSLQ. Here we give a more general formula, involving 3 distinct masses. A proof is devised, though it cannot be…

High Energy Physics - Theory · Physics 2007-05-23 D. J. Broadhurst

We prove that mean multiplicities in the length spectrum of a non-compact arithmetic hyperbolic orbifold of dimension $n \geqslant 4$ have exponential growth rate $$ \langle g(L) \rangle \geqslant c \frac{e^{([n/2] - 1)L}}{L^{1 + \delta_{5,…

Geometric Topology · Mathematics 2024-07-03 Alexandr Grebennikov

An integer vector $b \in \mathbb{Z}^d$ is a degree sequence if there exists a hypergraph with vertices $\{1,\dots,d\}$ such that each $b_i$ is the number of hyperedges containing $i$. The degree-sequence polytope $\mathscr{Z}^d$ is the…

Discrete Mathematics · Computer Science 2023-05-12 Eleonore Bach , Friedrich Eisenbrand , Rom Pinchasi

It is known that the lengths of closed geodesics of an arithmetic hyperbolic orbifold are related to Salem numbers. We initiate a quantitative study of this phenomenon. We show that any non-compact arithmetic $3$-dimensional orbifold…

Geometric Topology · Mathematics 2020-08-04 Mikhail Belolipetsky , Matilde Lalín , Plinio G. P. Murillo , Lola Thompson

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…

Combinatorics · Mathematics 2017-08-22 Álvaro Martínez-Pérez

A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…

Combinatorics · Mathematics 2016-07-20 Vladimir Blinovsky , Catherine Greenhill

If eps > 0 and p >= n^{-1/2 + eps}, in a binomial random graph G(n,p) a.a.s. the set of cycles which can be constructed as a symmetric difference of Hamilton circuits is as large as parity by itself permits (all cycles if n is odd, all even…

Combinatorics · Mathematics 2013-08-05 Peter C. Heinig

A {\em hole} in a graph is an induced subgraph which is a cycle of length at least four. A hole is called {\em even} if it has an even number of vertices. An {\em even-hole-free} graph is a graph with no even holes. A vertex of a graph is…

Combinatorics · Mathematics 2020-05-18 Maria Chudnovsky , Paul Seymour

Implicit schemes are popular methods for the integration of time dependent PDEs such as hyperbolic and parabolic PDEs. However the necessity to solve corresponding linear systems at each time step constitutes a complexity bottleneck in…

Numerical Analysis · Mathematics 2018-06-14 Houman Owhadi , Lei Zhang

A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms…

Combinatorics · Mathematics 2024-09-06 John Talbot , Jun Yan

All integer solutions $\left(M,a,c\right)$ to the problem of the sums of $M$ consecutive cubed integers $\left(a+i\right)^{3}$ ($a>1$, $0\leq i\leq M-1$) equaling squared integers $c^{2}$ are found by decomposing the product of the…

Number Theory · Mathematics 2015-01-27 Vladimir Pletser

We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…

Combinatorics · Mathematics 2019-06-26 David Conlon

Let $p$ be an odd natural number $\ge 3$. Inspired by results from Euclid's {\em Elements}, we express the irrational $$y=\sqrt[p]{d+\sqrt R}, $$ whose degree is $2p$, as a polynomial function of irrationals of degrees $\le p$. In certain…

Number Theory · Mathematics 2020-04-14 Kurt Girstmair

We consider hyperbolic manifolds with boundary, which admit an ideal triangulation with n ideal triangles and one edge. We prove that the number of these manifolds is $\exp(n\ln(n)+O(n))$.

Combinatorics · Mathematics 2015-06-30 A. Magazinov , I. Shnurnikov

We call a log variety (X, D) algebraically hyperbolic if there exists a positive number e such that 2g(C) - 2 + i(C, D) >= e deg(C) for all curves C on X, where i(C, D) is the number of the intersections between D and the normalization of…

Algebraic Geometry · Mathematics 2007-05-23 Xi Chen

For a nearly integrable Hamiltonian systems $H=h(p)+\epsilon P(p,q)$ with $(p,q)\in\mathbb{R}^3\times\mathbb{T}^3$, large normally hyperbolic invariant cylinders exist along the whole resonant path, except for the…

Dynamical Systems · Mathematics 2015-09-11 Chong-Qing Cheng

Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…

Classical Analysis and ODEs · Mathematics 2025-07-04 T. M. Dunster