English
Related papers

Related papers: d-representability as an embedding problem

200 papers

The quantum state of a $d$-dimensional system can be represented by the $d^2$ probabilities corresponding to a SIC-POVM, and then this distribution of probability can be represented by a vector of $\R^{d^2-1}$ in a simplex, we will call…

Quantum Physics · Physics 2011-06-09 Jose Ignacio Rosado

The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the $d$-dimensional space can be decomposed. It is a classical problem in combinatorial geometry that has been subject…

Combinatorics · Mathematics 2026-04-14 José Cáceres , Delia Garijo , Alberto Márquez , Rodrigo I. Silveira

Let $G$ be a locally compact totally disconnected topological group. Under a necessary mild assumption, we show that the irreducible unitary representations of $G$ are uniformly admissible if and only if the irreducible smooth…

Representation Theory · Mathematics 2018-10-16 Uriya A. First , Thomas Rüd

Let (X, t, S) be a triple, where S is a compact, connected surface without boundary, and t is a free cellular involution on a CW-complex X. The triple (X, t, S) is said to satisfy the Borsuk-Ulam property if for every continuous map…

Geometric Topology · Mathematics 2010-05-21 Daciberg Lima Gonçalves , John Guaschi

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

Combinatorics · Mathematics 2007-05-23 Anders Björner

We say that there is a representation of the universal algebra B in the universal algebra A if the set of endomorphisms of the universal algebra A has the structure of universal algebra B. Therefore, the role of representation of the…

Rings and Algebras · Mathematics 2011-11-28 Aleks Kleyn

We use the topology of simplicial complexes to model political structures following [1]. Simplicial complexes are a natural tool to encode interactions in the structures since a simplex can be used to represent a subset of compatible…

Physics and Society · Physics 2021-12-07 Andrea Mock , Ismar Volic

Using equivariant obstruction theory we construct equivariant maps from certain classifying spaces to representation spheres for cyclic groups, product of elementary Abelian groups and dihedral groups. Restricting them to finite skeleta…

Algebraic Topology · Mathematics 2016-07-22 Samik Basu , Surojit Ghosh

We give a decomposition of the Laplace operator (in matrix form) of a covering simplicial complex as a direct sum of several matrices, one of which is the Laplace operator of the base complex. It follows that the spectrum of a covering…

Combinatorics · Mathematics 2025-07-22 Yi-Zheng Fan , Yi-Min Song , Yi Wang

The paper proposes a novel technique for representing templates and instances of concept classes. A template representation refers to the generic representation that captures the characteristics of an entire class. The proposed technique…

Machine Learning · Computer Science 2020-07-08 Graham Spinks , Marie-Francine Moens

A filtration over a simplicial complex $K$ is an ordering of the simplices of $K$ such that all prefixes in the ordering are subcomplexes of $K$. Filtrations are at the core of Persistent Homology, a major tool in Topological Data Analysis.…

Computational Geometry · Computer Science 2018-02-06 Jean-Daniel Boissonnat , Karthik C. S.

Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…

Nuclear Theory · Physics 2009-10-30 Dimitri Kusnezov

In 1975 Wegner conjectured that the nerve of every finite good cover in R^d is d-collapsible. We disprove this conjecture. A good cover is a collection of open sets in R^d such that the intersection of every subcollection is either empty or…

Combinatorics · Mathematics 2010-08-12 Martin Tancer

We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise…

Geometric Topology · Mathematics 2022-04-12 S. Avvakumov , I. Mabillard , A. Skopenkov , U. Wagner

Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…

Algebraic Geometry · Mathematics 2007-05-23 Robert Friedman , John W. Morgan

The problem of representing a class of maps in a form suited for application of normal form methods is revisited. It is shown that using the methods of Lie series and of Lie transform a normal form algorithm is constructed in a…

Dynamical Systems · Mathematics 2013-04-01 Antonio Giorgilli

We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and…

Combinatorics · Mathematics 2007-10-14 Raul Cordovil , Manoel Lemos , Claudia Linhares Sales

Linial-Meshulam complex is a random simplicial complex on $n$ vertices with a complete $(d-1)$-dimensional skeleton and $d$-simplices occurring independently with probability p. Linial-Meshulam complex is one of the most studied…

Probability · Mathematics 2023-02-23 Kartick Adhikari , Kiran Kumar A. S. , Koushik Saha

A map $f: K \to \mathbb{R}^d$ of a simplicial complex is an almost embedding if $f(\sigma) \cap f(\tau) = \varnothing$ whenever $\sigma, \tau$ are disjoint simplices of $K$. Fix integers $d,k \geqslant 2$ such that $k+2 \leqslant d…

Geometric Topology · Mathematics 2022-06-28 Emil Alkin

Finding a suitable data representation for a specific task has been shown to be crucial in many applications. The success of subspace clustering depends on the assumption that the data can be separated into different subspaces. However,…

Computer Vision and Pattern Recognition · Computer Science 2021-06-21 Zhengrui Ma , Zhao Kang , Guangchun Luo , Ling Tian