Related papers: Lower bounds for designs in symmetric spaces
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
Dawar and Wilsenach (ICALP 2020) introduce the model of symmetric arithmetic circuits and show an exponential separation between the sizes of symmetric circuits for computing the determinant and the permanent. The symmetry restriction is…
We show that the topological complexity of an aspherical space $X$ is bounded below by the cohomological dimension of the direct product $A\times B$, whenever $A$ and $B$ are subgroups of $\pi_1(X)$ whose conjugates intersect trivially. For…
Rectangles are used to approximate objects, or sets of objects, in a plethora of applications, systems and index structures. Many tasks, such as nearest neighbor search and similarity ranking, require to decide if objects in one rectangle A…
Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block…
Symmetric functions, which take as input an unordered, fixed-size set, are known to be universally representable by neural networks that enforce permutation invariance. These architectures only give guarantees for fixed input sizes, yet in…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
Symmetry is at the heart of much of mathematics, physics, and art. Traditional geometric symmetry groups are defined in terms of isometries of the ambient space of a shape or pattern. If we slightly generalize this notion to allow the…
We give a general method for constructing examples of transcendental entire functions of given small order, which allows precise control over the size and shape of the set where the minimum modulus of the function is relatively large. Our…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…
A symmetric ideal is an ideal in a polynomial ring which is stable under all permutations of the variables. In this paper we initiate a global study of zero-dimensional symmetric ideals. By this we mean a geometric study of the invariant…
Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…
We construct harmonic Riemannian submersions that are retractions from symmetric spaces of noncompact type onto their rank-one totally geodesic subspaces. Among the consequences, we prove the existence of a non-constant, globally defined…
A $(v, k, \lambda)$ symmetric design is said to have the symmetric difference property (SDP) if the symmetric difference of any three blocks is either a block or the complement of a block. Symmetric designs fulfilling this property have the…
In this paper we study singular integrals on small (that is, measure zero and lower than full dimensional) subsets of metric groups. The main examples of the groups we have in mind are Euclidean spaces and Heisenberg groups. In addition to…
We derive an upper bound for the Assouad dimension of visible parts of self-similar sets generated by iterated function systems with finite rotation groups and satisfying the open set condition. The bound is valid for all visible parts and…
Consider the configuration spaces of manifolds. We give a precise formula for the integral cohomological dimension (the degree of top non-trivial integral cohomology group) of unordered configuration spaces of manifolds with non-trivial…
We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…
We classify all spherical 2-designs that arise as orbits of finite group actions on real inner product spaces. Although it is well known that such designs can occur in representations without trivial components, we give a complete…