English
Related papers

Related papers: Complex bounds for multimodal maps: bounded combin…

200 papers

We consider infinitely renormalizable Lorenz maps with real critical exponent $\alpha>1$ and combinatorial type which is monotone and satisfies a long return condition. For these combinatorial types we prove the existence of periodic points…

Dynamical Systems · Mathematics 2015-06-05 Marco Martens , Björn Winckler

We establish two-sided bounds for the complexity of two infinite series of closed orientable 3-dimensional hyperbolic manifolds, the Lobell manifolds and the Fibonacci manifolds.

Geometric Topology · Mathematics 2007-05-23 Sergei Matveev , Carlo Petronio , Andrei Vesnin

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

Dynamical Systems · Mathematics 2008-02-03 Alfredo Poirier

We extend bounds, proved by R.C. Thompson in 1966, on the sum of the $j$-th largest eigenvalues of the $(n-1) \times (n-1)$ principal matrices of an $n \times n$ Hermitian matrix. Our bounds are stronger than just summing up Thompson's…

Rings and Algebras · Mathematics 2026-01-26 Hristo Sendov , Mengxu Yuan

Every oriented 4-manifold admits a folded symplectic structure, which in turn determines a homotopy class of compatible almost complex structures that are discontinuous across the folding hypersurface ("fold") in a controlled fashion. We…

Symplectic Geometry · Mathematics 2014-11-11 Jens von Bergmann

Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…

Classical Analysis and ODEs · Mathematics 2020-11-03 Robert Carlson

We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…

Combinatorics · Mathematics 2020-05-11 Akansha Arora , Samrith Ram , Ayineedi Venkateswarlu

We present some results dealing with the local geometry of almost complex manifolds. We establish mainly the complete hyperbolicity of strictly pseudoconvex domains, the extension of plurisubharmonic functions through generic submanifolds…

Complex Variables · Mathematics 2007-05-23 Bernard Coupet , Herve Gaussier , Alexandre Sukhov

We prove a substantial extension of an inverse spectral theorem of Ambarzumyan, and show that it can be applied to arbitrary compact Riemannian manifolds, compact quantum graphs and finite combinatorial graphs, subject to the imposition of…

Spectral Theory · Mathematics 2010-10-04 E. B. Davies

In this paper, we prove a rigidity result for proper holomorphic maps between unit balls that have many symmetries and which extend to H\"older continuous maps on the boundary, with H\"older exponent strictly greater than 1/2.

Complex Variables · Mathematics 2026-02-20 Kyle Huang , Jinwoo Park , Aleksander Skenderi , Jaan Amla Srimurthy , Rou Wen , Andrew Zimmer

The boundedness tests for the number of compact integral manifolds of autonomous ordinary differential systems, of autonomous total differential systems, of linear systems of partial differential equations, of Pfaff systems of equations,…

Dynamical Systems · Mathematics 2010-09-16 V. N. Gorbuzov

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

We compare two known methods of extending a complex, unital, commutative normed algebra so as to include solutions to sets of monic polynomials over the original algebra. (One of these is a generalisation of a construction from the thesis…

Functional Analysis · Mathematics 2007-05-23 Thomas Dawson

We extend the definition of quasi-finite complexes by considering not necessarily countable complexes. We provide a characterization of quasi-finite complexes in terms of L-invertible maps and dimensional properties of compactifications.…

General Topology · Mathematics 2007-05-23 Alex Karasev , Vesko Valov

In this paper, we develop the infinitesimal geometry of the limit spaces of compact Riemannian manifolds with boundary, where we assume lower bounds on the sectional curvatures of manifolds and boundaries and the second fundamental forms of…

Differential Geometry · Mathematics 2026-04-14 Takao Yamaguchi , Zhilang Zhang

We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…

Combinatorics · Mathematics 2026-04-14 Benjamin Nill

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.

Number Theory · Mathematics 2014-03-12 Jean Bourgain , Sergei Konyagin , Igor Shparlinski

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

Combinatorics · Mathematics 2020-01-22 Gwendal Collet , Michael Drmota , Lukas Daniel Klausner

This paper studies generalization error bounds for Transformer models. Based on the offset Rademacher complexity, we derive sharper generalization bounds for different Transformer architectures, including single-layer single-head,…

Machine Learning · Computer Science 2026-03-24 Yawen Li , Tao Hu , Zhouhui Lian , Wan Tian , Yijie Peng , Huiming Zhang , Zhongyi Li

We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…

Data Structures and Algorithms · Computer Science 2025-11-04 Oscar Defrain , Arthur Ohana , Simon Vilmin