Related papers: Equiangular tight frames with centroidal symmetry
Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
Group equivariance (e.g. SE(3) equivariance) is a critical physical symmetry in science, from classical and quantum physics to computational biology. It enables robust and accurate prediction under arbitrary reference transformations. In…
We describe the equivariant cohomology ring of rationally smooth projective embeddings of reductive groups. These embeddings are the projectivizations of reductive monoids. Our main result describes their equivariant cohomology in terms of…
The landmark paper "Constructing tight fusion frames" by Casazza, Fickus, Mixon, Wang and Zhou introduced a fundamental method for constructing unit norm tight frames, which they called Spectral Tetris. This was a significant advancement…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
The eccentricity matrix $\epsilon(G)$, of a connected graph $G$ is obtained by retaining the maximum distance from each row and column of the distance matrix of $G$ and the other entries are assigned with 0. In this paper, we discuss the…
We prove that if a rectangular matrix with uniformly small entries and approximately orthogonal rows is applied to the independent standardized random variables with uniformly bounded third moments, then the empirical CDF of the resulting…
A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edge lengths has the same pairwise distances…
A class of topological spaces is topologically rigid if any two spaces with the same fundamental group are also homeomorphic. Topological rigidity, in addition to its intrinsic interest, has been useful for solving abstract commensurability…
Characterization results for equality cases and for rigidity of equality cases in Steiner's perimeter inequality are presented. (By rigidity, we mean the situation when all equality cases are vertical translations of the Steiner's symmetral…
The Strong Exponential Time Hypothesis (SETH) is a standard assumption in (fine-grained) parameterized complexity and many tight lower bounds are based on it. We consider a number of reasonable weakenings of the SETH, with sources from (i)…
Spectral tetris is a fexible and elementary method to construct unit norm frames with a given frame operator, having all of its eigenvalues greater than or equal to two. One important application of spectral tetris is the construction of…
It's known that if $d^2$ vectors from $d$-dimensional Hilbert space $H$ form a SIC-POVM (SIC for short) then tensor square of those vectors form an equiangular tight frame on the symmetric subspace of $H\otimes H$. We prove that for any SIC…
We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the…
Fusion frames consist of a sequence of subspaces from a Hilbert space and corresponding positive weights so that the sum of weighted orthogonal projections onto these subspaces is an invertible operator on the space. Given a spectrum for a…
In a graph $A$, the measure $|M_g^A(f)|=m_g^A(f)$ for each arbitrary edge $f=gh$ counts the edges in $A$ closer to $g$ than $h$. $A$ is termed an edge quasi-$\lambda$-distance-balanced graph in a metric space (abbreviated as $EQDBG$), where…
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…
We take the tensor network describing explicit p-adic CFT partition functions proposed in [1], and considered boundary conditions of the network describing a deformed Bruhat-Tits (BT) tree geometry. We demonstrate that this geometry…
Four dimensional scalar-tensor theory is considered within two conformal frames, the Jordan frame (JF) and the Einstein frame (EF). The actions for the theory are equivalent and equations of motion can be obtained from each action. It is…