Related papers: Symmetric Algebraic Circuits and Homomorphism Poly…
We examine the capacity of the complementarity spectrum to distinguish non-isomorphic digraphs. We focus on the seven families with exactly three complementarity eigenvalues. Our findings reveal that in some, but not all families, any two…
We show that any closed model category of simplicial algebras over an algebraic theory is Quillen equivalent to a proper closed model category. By ``simplicial algebra'' we mean any category of algebras over a simplicial algebraic theory,…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
For families of Hamiltonians defined by parts that are local, the most general definition of a symmetry algebra is the commutant algebra, i.e., the algebra of operators that commute with each local part. Thinking about symmetry algebras as…
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…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
We study the structure of a family of algebras which encodes a generalization of the Pieri Rule for the complex orthogonal group. In particular, we show that each of these algebras has a standard monomial basis and has a flat deformation to…
Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idempotent polymorphisms of certain digraph classes. Our first results are two algebraic dichotomy, even "gap",…
Persistence diagrams, combining geometry and topology for an effective shape description used in pattern recognition, have already proven to be an effective tool for shape representation with respect to a certainfiltering function.…
Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights. Using the theory of graph limits, we can equivalently evaluate…
We consider cohomology of diagrams of algebras by Beck's approach, using comonads. We then apply this theory to computing the cohomology of $\Psi$-rings. Our main result is that there is a spectral sequence connecting the cohomology of the…
Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise CSPs, we propose an algebraic framework for valued…
In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-edges}. A graph is called {\em simple} if it contains no…
We consider the inclusion of the space of algebraic (regular) maps between real algebraic varieties in the space of all continuous maps. For a certain class of real algebraic varieties, which include real projective spaces, it is well known…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…
For a positive integer $k$, the \emph{ total $k$-cut complex} of a graph $G$, denoted as $\Delta_k^t(G)$, is the simplicial complex whose facets are $\sigma \subseteq V(G)$ such that $|\sigma| = |V(G)|-k$ and the induced subgraph $G[V(G)…