English
Related papers

Related papers: Bounds on saddle connections for flat spheres

200 papers

A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…

Computational Geometry · Computer Science 2014-10-24 Stylianos C. Despotakis , Ioannis Z. Emiris

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

Metric Geometry · Mathematics 2014-09-26 David de Laat , Fernando Mario de Oliveira Filho , Frank Vallentin

We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $\min_x\max_y f(x) + \langle y,\mathbf{B} x\rangle - g(y)$. In the highly specific case where each of the functions $f(x)$ and $g(y)$ is either affine…

Optimization and Control · Mathematics 2024-11-25 Dmitry Kovalev , Ekaterina Borodich

We prove effective bounds on the rate in the quadratic growth asymptotics for the orbit of a non-uniform lattice of SL(2,R), acting linearly on the plane. This gives an error bound in the count of saddle connection holonomies, for some…

Dynamical Systems · Mathematics 2024-12-17 Claire Burrin , Amos Nevo , Rene Rühr , Barak Weiss

From a geometric viewpoint, billiard trajectories and geodesics are related by mutual approximation results. In one direction, it is known that every geodesic curve in the boundary of a smooth convex body can be approximated by a sequence…

Differential Geometry · Mathematics 2026-02-04 Daniele Giannetto

Finding the maximum size of a Sidon set in $\mathbb{F}_2^t$ is of research interest for more than 40 years. In order to tackle this problem we recall a one-to-one correspondence between sum-free Sidon sets and linear codes with minimum…

Combinatorics · Mathematics 2026-01-05 Ingo Czerwinski , Alexander Pott

We give a linear upper bound on the number of distinct volume-equivalent frameworks of bipyramids, up to rigid motions. As a corollary, we show that global volume rigidity is not a generic property of simplicial complexes.

Combinatorics · Mathematics 2026-01-27 Jack Southgate

This paper provides a direct method of establishing the existence and uniqueness of saddle-node bifurcations for nonlinear equations in general domains. The method employs the scaled extended quotient whose saddle points correspond to the…

Analysis of PDEs · Mathematics 2024-04-09 Yavdat Il'yasov

We establish the slope equality and give an upper bound of the slope for finite cyclic covering fibrations of an elliptic surface including bielliptic fibrations of genus greater than 5. We also give an upper bound of the slope for triple…

Algebraic Geometry · Mathematics 2016-04-26 Makoto Enokizono

In an ordinary billiard system trajectories of a Hamiltonian system are elastically reflected after a collision with a hypersurface (scatterer). If the scatterer is a submanifold of codimension more than one, we say that the billiard is…

Dynamical Systems · Mathematics 2016-06-23 Sergey Bolotin

We establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover we give examples of Shimura curves that do not descend over their field…

Information Theory · Computer Science 2017-06-13 Stéphane Ballet , Julia Pieltant , Matthieu Rambaud , Jeroen Sijsling

New criteria are established for upper bounds on the number of limit cycles of periodic Abel differential equations having two periodic invariant curves, one of them bounded. The criteria are applied to obtain upper bounds of either zero or…

Classical Analysis and ODEs · Mathematics 2020-07-06 José Luis Bravo Trinidad , Luis Ángel Calderón Pérez , Manuel Fernández García-Hierro

In contrast to elliptic surfaces, the Fourier restriction problem for hypersurfaces of non-vanishing Gaussian curvature which admit principal curvatures of opposite signs is still hardly understood. In fact, even for 2-surfaces, the only…

Classical Analysis and ODEs · Mathematics 2019-07-04 Stefan Buschenhenke , Detlef Müller , Ana Vargas

We establish new upper bounds for the height of the S-integral points of an elliptic curve. This bound is explicitly given in terms of the set S of places of the number field K involved, but also in terms of the degree of K, as well as the…

Number Theory · Mathematics 2012-08-15 Vincent Bosser , Andrea Surroca

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…

This paper is a sequel to my paper "Introducing the Plaid Model". In this paper it is shown that the plaid model has unbounded polygonal paths for every irrational parameter. This result parallels my result that outer billiards on kites has…

Dynamical Systems · Mathematics 2015-07-15 Richard Evan Schwartz

Given an elliptic surface $\mathcal{E}\to\mathcal{C}$ over a field $k$ of characteristic zero equipped with zero section $O$ and another section $P$ of infinite order, we give a simple and explicit upper bound on the number of points where…

Algebraic Geometry · Mathematics 2020-05-27 Douglas Ulmer , Giancarlo Urzúa

We give lowed bounds on the number of periodic trajectories in strictly convex smooth billiards in $\R^{m+1}$ for $m\ge 3$. For plane billiards (when m=1) such bounds were obtained by G. Birkhoff in the 1920's. Our proof is based on…

Differential Geometry · Mathematics 2007-05-23 Michael Farber , Serge Tabachnikov

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

Combinatorics · Mathematics 2008-12-31 Alexander Dainiak

Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…

Combinatorics · Mathematics 2014-05-27 Gary Gordon , Jennifer McNulty , Nancy Ann Neudauer
‹ Prev 1 3 4 5 6 7 10 Next ›