English
Related papers

Related papers: Lower bounds for designs in symmetric spaces

200 papers

It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…

Differential Geometry · Mathematics 2024-01-02 Ramazan Yol

A Smale space is a chaotic dynamical system with canonical coordinates of contracting and expanding directions. The basic sets for Smale's Axiom A systems are a key class of examples. We consider the special case of irreducible Smale spaces…

Dynamical Systems · Mathematics 2019-02-20 Susana Wieler

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…

Group Theory · Mathematics 2007-05-23 Vladimir Tolstykh

We study finite systems of subspaces of a complex Hilbert space such that each pair of subspaces satisfies a certain condition as described in the following. For each subspace excepting the first one an angle between this subspace and the…

Functional Analysis · Mathematics 2012-01-18 Ivan Feshchenko , Alexander Strelets

We investigate how sorting algorithms efficiently overcome the exponential size of the permutation space. Our main contribution is a new continuous-time formulation of sorting as a gradient flow on the permutohedron, yielding an independent…

Data Structures and Algorithms · Computer Science 2025-04-24 Jonathan Landers

We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…

Functional Analysis · Mathematics 2007-05-23 Stanislaw J. Szarek , Nicole Tomczak-Jaegermann

This paper develops an explicit and implementable framework for constructing spherical designs by lifting point sets from tight fusion frames. By combining existing ingredients, we obtain, in every dimension, explicit spherical $5$-designs…

Combinatorics · Mathematics 2026-02-24 Ryutaro Misawa

We prove for the first time a pointwise lower estimate of the normal injectivity radius of an embedded hypersurface in an arbitrary Riemannian manifold. Main applications include: (i) a pointwise lower estimate of the graphing radius of a…

Differential Geometry · Mathematics 2025-11-26 Sebastian Boldt , Batu Güneysu , Stefano Pigola

Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are only finitely many regular dessins with…

Group Theory · Mathematics 2013-09-23 Gareth A. Jones

We introduce the notion of fully simple maps, which are maps with non self-intersecting disjoint boundaries. In contrast, maps where such a restriction is not imposed are called ordinary. We study in detail the combinatorics of fully simple…

Mathematical Physics · Physics 2023-07-07 Gaëtan Borot , Elba Garcia-Failde

A Hilbert space operator $U$ is called universal (in the sense of Rota) if every Hilbert space operator is similar to a multiple of $U$ restricted to one of its invariant subspaces. It follows that the Invariant Subspace Problem for Hilbert…

Functional Analysis · Mathematics 2021-01-22 João R. Carmo , S. Waleed Noor

We consider a class of non-polynomial spline spaces over T-meshes, that is, of spaces locally spanned both by polynomial and by suitably-chosen non-polynomial functions, which we will refer to as generalized splines over T-meshes. For such…

Numerical Analysis · Mathematics 2014-09-26 Cesare Bracco , Fabio Roman

We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized…

Combinatorics · Mathematics 2025-09-30 Vedran Krčadinac , Mario Osvin Pavčević , Kristijan Tabak

A generalisation of Riemannian geometry is considered, based exclusively on the minimal assumptions that the line element $ds$ is a regular function of position and direction and that the distance of every point from itself is equal to…

General Physics · Physics 2018-04-03 Paolo Maraner

This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…

Optimization and Control · Mathematics 2020-09-04 Daniel Reem , Simeon Reich , Alvaro De Pierro

We resolve a longstanding open problem by reformulating the Grassmannian fusion frames to the case of mixed dimensions and show that this satisfies the proper properties for the problem. In order to compare elements of mixed dimension, we…

Functional Analysis · Mathematics 2019-11-14 Peter G. Casazza , John I. Haas , Joshua Stueck , Tin T. Tran

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

Representation Theory · Mathematics 2026-04-21 Shahar Dagan

In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…

General Relativity and Quantum Cosmology · Physics 2009-10-22 Alexander V. Evako

We prove a theorem describing the limiting fine-scale statistics of orbits of a point in hyperbolic space under the action of a discrete subgroup. Similar results have been proved only in the lattice case, with two recent infinite-volume…

Dynamical Systems · Mathematics 2023-06-22 Christopher Lutsko

We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.

Information Theory · Computer Science 2019-05-14 Alexander Barg , Dmitry Nogin