English
Related papers

Related papers: d-representability as an embedding problem

200 papers

Geometric deep learning extends deep learning to incorporate information about the geometry and topology data, especially in complex domains like graphs. Despite the popularity of message passing in this field, it has limitations such as…

Machine Learning · Computer Science 2024-03-18 Kelly Maggs , Celia Hacker , Bastian Rieck

Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…

Social and Information Networks · Computer Science 2023-04-26 Hyunju Kim , Jihoon Ko , Fanchen Bu , Kijung Shin

We consider the realization space of the $d$-dimensional cube, and show that any two realizations are connected by a finite sequence of projective transformations and normal transformations. We use this fact to define an analog of the…

Combinatorics · Mathematics 2019-12-23 Karim Adiprasito , Daniel Kalmanovich , Eran Nevo

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…

Combinatorics · Mathematics 2010-02-17 Allen Knutson , Ezra Miller , Alexander Yong

The spectral representation is an effecient tool to explore electrical properties of material mixtures. It separates the contributions of geometrical topology and intrinsic properties of the constituents in the system. The aim of this paper…

Materials Science · Physics 2007-05-23 Enis Tuncer

We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…

General Topology · Mathematics 2025-06-16 Logan C. Hoehn , Hugo Adrian Maldonado-Garcia

B\'ar\'any's "topological Tverberg conjecture" from 1976 states that any continuous map of an $N$-simplex $\Delta_N$ to $\mathbb{R}^d$, for $N\ge(d+1)(r-1)$, maps points from $r$ disjoint faces in $\Delta_N$ to the same point in…

Combinatorics · Mathematics 2017-05-23 Pavle V. M. Blagojević , Günter M. Ziegler

In this paper some properties of the irreducible multiplets of representation for the N = (p, q) - extended supersymmetry in one dimension are discussed. Essentially two results are here presented. At first a peculiar property of the one…

High Energy Physics - Theory · Physics 2009-10-31 A. Pashnev , F. Toppan

This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…

K-Theory and Homology · Mathematics 2009-04-30 Mohamed Barakat

Inspired by Menshov's representation theorem, we prove that there exists a sequence of frequecies such that any measurable (complex valued) function on R can be represented as a sum of almost everywhere convergent trigonometric series with…

Classical Analysis and ODEs · Mathematics 2007-05-23 Gady Kozma , Alexander Olevskii

The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…

Logic · Mathematics 2026-02-03 Roman Feller , Michael Pinsker

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

Combinatorics · Mathematics 2024-01-05 Hamid Reza Daneshpajouh , Frédéric Meunier

This paper is about a small combinatorial trick, which is well known, but has no name. Let G be a permutation group acting on a vector space M. There is a natural way to assign a cosimplicial space to these data. We call the resulting…

Quantum Algebra · Mathematics 2011-03-29 Pavol Severa , Thomas Willwacher

Community detection in graphs is a problem that is likely to be relevant whenever network data appears, and consequently the problem has received much attention with many different methods and algorithms applied. However, many of these…

Combinatorics · Mathematics 2025-05-16 Vilhelm Agdur

The representability theorem for stacks, due to Artin in the underived setting and Lurie in the derived setting, gives conditions under which a stack is representable by an $n$-geometric stack. In recent work of Ben-Bassat, Kelly, and…

Algebraic Geometry · Mathematics 2025-11-17 Rhiannon Savage

Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…

Optimization and Control · Mathematics 2011-03-30 Jiawang Nie

The theory of $k$-regular graphs is closely related to group theory. Every $k$-regular, bipartite graph is a Schreier graph with respect to some group $G$, a set of generators $S$ (depending only on $k$) and a subgroup $H$. The goal of this…

Combinatorics · Mathematics 2016-07-27 Alexander Lubotzky , Zur Luria , Ron Rosenthal

We study how tensor products of representations decompose when restricted from a compact Lie algebra to one of its subalgebras. In particular, we are interested in tensor squares which are tensor products of a representation with itself. We…

Mathematical Physics · Physics 2015-08-25 Robert Zeier , Zoltán Zimborás

We generalize the classic definition of Delaunay triangulation and prove that for a locally finite and coarsely dense generic point set, $A \subseteq \mathbb{R}^d$, the $d$-simplices whose vertices belong to $A$ and whose circumscribed…

Combinatorics · Mathematics 2025-09-08 Herbert Edelsbrunner , Alexey Garber , Morteza Saghafian

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

Algebraic Geometry · Mathematics 2026-01-21 Alejandro González Nevado