Related papers: Factor system for graphs and combinatorial HHS
The variational quantum eigensolver has been proposed as a low-depth quantum circuit that can be employed to examine strongly correlated systems on today's noisy intermediate-scale quantum computers. We examine details associated with the…
We call a set $\mathcal S$ of graphs an "even subdivison-factor" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $\mathcal…
We give polynomial-time algorithms for obtaining hamilton circuits in random graphs, G, and random directed graphs, D. If n is finite, we assume that G or D contains a hamilton circuit. If G is an arbitrary graph containing a hamilton…
We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix contain at most one unit in common. These matrices are equivalent to…
We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
We group all known quadratizations of cubic and quartic terms in binary optimization problems into six and seven unique graphs respectively. We then perform a minor embedding of these graphs onto the well-known Chimera graph, and the brand…
We have established a coherent framework for applying variational methods to partial differential equations on hypergraphs, which includes the propositions of calculus and function spaces on hypergraphs. Several results related to the…
We describe an algorithm to compute the geodesics in an arbitrary CAT(0) cubical complex. A key tool is a correspondence between cubical complexes of global non-positive curvature and posets with inconsistent pairs. This correspondence also…
In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…
In this paper we formulate and prove a combinatorial version of the section conjecture for finite groups acting on finite graphs. We apply this result to the study of rational points and show that finite descent is the only obstruction to…
We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…
Quasidiagonal operators on a Hilbert space are a large and important class (containing all self-adjoint operators for instance). They are also perfectly suited for study via the finite section method (a particular Galerkin method). Indeed,…
Let $V$ be a finite graph and let $\phi:V\rightarrow V$ be an irreducible train track map whose mapping torus has word-hyperbolic fundamental group $G$. Then $G$ acts freely and cocompactly on a CAT(0) cube complex.
We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…
Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or…
In this article the notions of (quasi weakly hereditary) general closure operator $\mb{C}$ on a category $\cx$ with respect to a class $\cm$ of morphisms, and quasi factorization structures in a category $\cx$ are introduced. It is shown…
The present paper is devoted to clustering geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalization, which we call higher-order spectral clustering. It…
Coloring the arcs of biregular graphs was introduced with possible applications to industrial chemistry, molecular biology, cellular neuroscience, etc. Here, we deal with arc coloring in some non-bipartite graphs. In fact, for…
We study a combinatorial model of the quantum scalar field with polynomial potential on a graph. In the first quantization formalism, the value of a Feynman graph is given by a sum over maps from the Feynman graph to the spacetime graph…