Related papers: Cubes of symmetric designs
We study the reciprocal position of nine points in the plane, according to their collinearities. In particular, we consider the case in which the nine points are contained in an irreducible cubic curve and we give their classification. If…
A complex Hadamard matrix is a square matrix W with complex entries of absolute value 1 satisfying WW*=nI, where * stands for the Hermitian transpose and I is the identity matrix of order n. In this paper, we give constructions of complex…
These notes provide an introduction to the noncommutative matrix geometry which arises within matrix models of Yang-Mills type. Starting from basic examples of compact fuzzy spaces, a general notion of embedded noncommutative spaces…
The study of regular incidence structures such as projective planes and symmetric block designs is a well established topic in discrete mathematics. Work of Bruck, Ryser and Chowla in the mid-twentieth century applied the Hasse-Minkowski…
Using the ideas of concatenation construction of codes over the $q$-ary alphabet, we modify the known generalized Sylvester-type construction of the Hadamard matrices. The new construction is based on two collections of the Hadamard…
We investigate $U(1)^{\,n}$ supersymmetric Born-Infeld Lagrangians with a second non-linearly realized supersymmetry. The resulting non-linear structure is more complex than the square root present in the standard Born-Infeld action, and…
We formulate N-fold supersymmetry in quantum mechanical matrix models. As an example, we construct general two-by-two Hermitian matrix 2-fold supersymmetric quantum mechanical systems. We find that there are two inequivalent such systems,…
All one-massless-loop Feynman diagrams could be written like a linear combination of scalar boxes, triangles an bubbles in $n$ dimensions plus rational terms. However, the four-point scalar integrals in $n+2$ dimensions are free of infrared…
It is shown that the coincidence isometries of certain modules in Euclidean $n$-space can be decomposed into a product of at most $n$ coincidence reflections defined by their non-zero elements. This generalizes previous results obtained for…
Tridiagonal canonical forms of square matrices under congruence or *congruence, pairs of symmetric or skew-symmetric matrices under congruence, and pairs of Hermitian matrices under *congruence are given over an algebraically closed field…
Identifying symmetries in data sets is generally difficult, but knowledge about them is crucial for efficient data handling. Here we present a method how neural networks can be used to identify symmetries. We make extensive use of the…
We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…
Working on doubling metric spaces, we construct generalised dyadic cubes adapting ultrametric structure. If the space is complete, then the existence of such cubes and the mass distribution principle lead into a simple proof for the…
We investigate spherical 4-distance 7-designs by studying their distance distributions. We compute these distance distributions and use their product (an integer) to derive certain divisibility conditions relating the dimension $n$ and the…
We introduce a construction that, given a pair (u,v) of complex Hadamard matrices of the same order, generates infinitely many biunitary matrices of varying (and distinct) orders. As a key application, this framework yields nested sequences…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We use inverse methods of statistical mechanics and computer simulations to investigate whether an isotropic interaction designed to stabilize a given two-dimensional (2D) lattice will also favor an analogous three-dimensional (3D)…
Statisticians increasingly face the problem to reconsider the adaptability of classical inference techniques. In particular, divers types of high-dimensional data structures are observed in various research areas; disclosing the boundaries…
The paper is motivated by an analogy between cluster algebras and Kac-Moody algebras: both theories share the same classification of finite type objects by familiar Cartan-Killing types. However the underlying combinatorics beyond the two…
Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We study a notion of MDS on infinite metric measure spaces,…