Related papers: Correlations in totally symmetric self-complementa…
While tremendous research has revealed that symmetry enriches topological phases of matter, more general principles that protect topological phases have yet to be explored. In this Letter, we elucidate the roles of subspaces in…
Recently, there has been interest in the question of whether a partial matrix in which many of the fully defined principal submatrices are PSD is approximately PSD completable. These questions are related to graph theory because we can…
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
Symmetric edge polytopes, a.k.a. PV-type adjacency polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In…
Although shape correspondence is a central problem in geometry processing, most methods for this task apply only to two-dimensional surfaces. The neglected task of volumetric correspondence--a natural extension relevant to shapes extracted…
The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and…
The set of all subspaces of a given dimension in a finite classical polar space has a structure of a symmetric association scheme. If the dimension is zero, this is the scheme of the collinearity graph of the space; If the dimension is…
The article is devoted to a structure of topological spaces related with topological quasigroups. Regular and complete spaces over topological quasigroups are studied. Separations and embeddings are also investigated for them. Their…
The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are methods to enumerate perfect matchings of plane graphs that was discovered by P. W. Kasteleyn. We present several new techniques and arguments related…
We study one and two point functions of conformal field theories on spaces of maximal symmetry with and without boundaries and investigate their spectral representations. Integral transforms are found, relating the spectral decomposition to…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
A compact Riemannian manifold is associated with geometric data given by the eigenvalues of various Laplacian operators on the manifold and the triple overlap integrals of the corresponding eigenmodes. This geometric data must satisfy…
In this paper we enumerate the centrally symmetric lozenge tilings of a hexagon with a shamrock removed from its center. Our proof is based on a variant of Kuo's graphical condensation method in which only three of the four involved…
The closest pair of points problem or closest pair problem (CPP) is an important problem in computational geometry where we have to find a pair of points from a set of points in metric space with the smallest distance between them. This…
A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…
A harmonic mapping is a univalent harmonic function of one complex variable. We define a family of harmonic mappings on the unit disk whose images are rotationally symmetric rosettes with $n$ cusps or n nodes, where $n \ge 3$. These…
Einstein's field equations for spatially self-similar spherically symmetric perfect-fluid models are investigated. The field equations are rewritten as a first-order system of autonomous differential equations. Dimensionless variables are…
We study isometric representations of product systems of correspondences over the semigroup $\mathbb{N}^k$ which are minimal dilations of finite dimensional, fully coisometric representations. We show the existence of a unique minimal…
We are concerned with split graphs and pseudo-split graphs whose complements are isomorphic to themselves. These special subclasses of self-complementary graphs are actually the core of self-complementary graphs. Indeed, we show that all…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…