English
Related papers

Related papers: A dichotomy for succinct representations of homomo…

200 papers

We describe a construction that to each algebraically specified notion of higher-dimensional category associates a notion of homomorphism which preserves the categorical structure only up to weakly invertible higher cells. The construction…

Category Theory · Mathematics 2011-10-17 Richard Garner

In this paper we are interested in decomposing a dihypergraph $\mathcal{H} = (V, \mathcal{E})$ into simpler dihypergraphs, that can be handled more efficiently. We study the properties of dihypergraphs that can be hierarchically decomposed…

Discrete Mathematics · Computer Science 2020-06-23 Lhouari Nourine , Simon Vilmin

Given a coalgebra C over a cooperad, and an algebra A over an operad, it is often possible to define a natural homotopy Lie algebra structure on hom(C,A), the space of linear maps between them, called the convolution algebra of C and A. In…

Quantum Algebra · Mathematics 2018-11-12 Daniel Robert-Nicoud , Felix Wierstra

An abstract simplicial complex is said to be $d$-representable if it records the intersection pattern of a collection of convex sets in $\mathbb{R}^d$. In this paper, we show that $d$-representability of a simplicial complex is equivalent…

Combinatorics · Mathematics 2023-07-11 Moshe White

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

Logic · Mathematics 2011-05-31 Manuel Bodirsky , Michael Pinsker

A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the…

Computational Complexity · Computer Science 2019-06-28 Jacob Focke , Leslie Ann Goldberg , Stanislav Zivny

Given graphs $H$ and $G$, possibly with vertex-colors, a homomorphism is a function $f:V(H)\to V(G)$ that preserves colors and edges. Many interesting counting problems (e.g., subgraph and induced subgraph counts) are finite linear…

Computational Complexity · Computer Science 2023-05-09 Radu Curticapean

We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We start with the following notion due to N.Thi\'ery and the second author.…

Combinatorics · Mathematics 2014-09-05 Djamila Oudrar , Maurice Pouzet

We will start from the beginning and define a matroid and its Orlik-Solomon algebra and holonomy Lie algebra, but first we give some background from topology and cohomology. A (central) hyperplane arrangement is a finite number of subspaces…

Combinatorics · Mathematics 2020-12-23 Clas Löfwall

Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the…

Computational Complexity · Computer Science 2012-07-11 Jin-Yi Cai , Pinyan Lu , Mingji Xia

We introduce several homotopy equivalence relations for proper holomorphic mappings between balls. We provide examples showing that the degree of a rational proper mapping between balls (in positive codimension) is not a homotopy invariant.…

Complex Variables · Mathematics 2015-09-30 John P. D'Angelo , Jiri Lebl

In the constraint satisfaction problem ($CSP$), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost homomorphism problem ($MinHom$), one is additionally given weights…

Machine Learning · Computer Science 2010-04-06 Rustem Takhanov

Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…

Computational Complexity · Computer Science 2025-12-16 Marek Černý , Tim Seppelt

Let $A_g$ be an abelian variety of dimension $g$ and $p$-rank $\lambda \leq 1$ over an algebraically closed field of characteristic $p>0$. We compute the number of homomorphisms from $\pi_1^{\text{\'et}}(A_g,a)$ to $GL_n(\mathbb F_q)$,…

Algebraic Geometry · Mathematics 2018-06-22 Brett Frankel

We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…

Category Theory · Mathematics 2025-05-21 Benjamin Merlin Bumpus , Zoltan A. Kocsis , Jade Edenstar Master , Emilio Minichiello

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

Combinatorics · Mathematics 2015-08-04 Alexander Barvinok , Pablo Soberón

One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…

Category Theory · Mathematics 2025-11-24 Suddhasattwa Das

Motivated by the study of the interrelation between functorial and algebraic quantum field theory, we point out that on any locally trivial bundle of compact groups, representations up to homotopy are enough to separate points by means of…

Differential Geometry · Mathematics 2015-12-03 Giorgio Trentinaglia , Chenchang Zhu

The theoretical basis of the phenomenon of effective and exact dimensional reduction, or holographic correspondence, is investigated in a wide variety of physical systems. We first derive general inequalities linking quantum systems of…

Statistical Mechanics · Physics 2013-01-16 Zohar Nussinov , Gerardo Ortiz , Emilio Cobanera

We study the de Rham complex of relative differential forms on compact manifolds with boundary. Chain homotopies for this complex are highly non-unique, and different homotopies can have different analytic properties, particularly near the…

Differential Geometry · Mathematics 2024-08-02 Andrea Nützi
‹ Prev 1 4 5 6 7 8 10 Next ›