Related papers: On quantum topology, hypergraphs and flag vectors

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…

We say that a first order formula A distinguishes a graph G from another graph G' if A is true on G and false on G'. Provided G and G' are non-isomorphic, let D(G,G') denote the minimal quantifier rank of a such formula. We prove that, if G…

Flag manifolds are shown to describe the relations between configurations of distinguished points (topologically equivalent to punctures) embedded in a general spacetime manifold. Grassmannians are flag manifolds with just two subsets of…

In a recent paper Jones introduced a correspondence between elements of the Thompson group $F$ and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be…

Link invariants, for 3-manifolds, are defined in the context of the Rozansky-Witten theory. To each knot in the link one associates a holomorphic bundle over a holomorphic symplectic manifold X. The invariants are evaluated for b_{1}(M)…

We analyze few-body quantum states with particular correlation properties imposed by the requirement of maximal bipartite entanglement for selected partitions of the system into two complementary parts. A novel framework to treat this…

A clover is a framed trivalent graph with some additional structure, embedded in a 3-manifold. We define surgery on clovers, generalizing surgery on Y-graphs used earlier by the second author to define a new theory of finite-type invariants…

The topological Tverberg theorem states that for any prime power q and continuous map from a (d+1)(q-1)-simplex to R}^d, there are q disjoint faces F_i of the simplex whose images intersect. It is possible to put conditions on which pairs…

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

The quantum cohomology algebra of the (full) flag manifold is a fundamental example in quantum cohomology theory, with connections to combinatorics, algebraic geometry, and integrable systems. Using a differential geometric approach, we…

A natural explicit condition is given ensuring that an action of the multiplicative monoid of non-negative reals on a manifold F comes from homotheties of a vector bundle structure on F, or, equivalently, from an Euler vector field. This is…

We define and develop a homotopy invariant notion for the topological complexity of a map $f:X \to Y$, denoted TC($f$), that interacts with TC($X$) and TC($Y$) in the same way cat($f$) interacts with cat($X$) and cat($Y$). Furthermore,…

We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given…

We define and study a bigraded knot invariant whose Euler characteristic is the Alexander polynomial, closely connected to knot Floer homology. The invariant is the homology of a chain complex whose generators correspond to Kauffman states…

If $\mathbb{F}_{q}$ is a finite field, $C$ is a vector subspace of $\mathbb{F}_{q}^{n}$ (linear code), and $G$ is a subgroup of the group of linear automorphisms of $\mathbb{F}_{q}^{n}$, $C$ is said to be $G$-invariant if $g(C)=C$ for all…

Graph Isomorphism is such an important problem in computer science, that it has been widely studied over the last decades. It is well known that it belongs to NP class, but is not NP-complete. It is thought to be of comparable difficulty to…

Quantum theory has shown its superiority in enhancing machine learning. However, facilitating quantum theory to enhance graph learning is in its infancy. This survey investigates the current advances in quantum graph learning (QGL) from…

We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…

In super-symmetric quantum theory, or in string theory, (including generalizations of these theories to underlying quantum spaces) we study a certain partition function Z(Q,A,g). Here Q denotes a supercharge, A denotes an observable with…