Related papers: From complexity to algebra and back: digraph class…
Quadratically constrained quadratic programs (QCQPs) are a highly expressive class of nonconvex optimization problems. While QCQPs are NP-hard in general, they admit a natural convex relaxation via the standard (Shor) semidefinite program…
Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbours are shown grouped into modules. An edge connected to the…
In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…
This paper introduces an analogue of the Solomon descent algebra for the complex reflection groups of type $G(r,1,n)$. As with the Solomon descent algebra, our algebra has a basis given by sums of `distinguished' coset representatives for…
The paper constructs an infinite sequence of strongly regular directed graphs. The construction is based on representing adjacency matrices as block matrices composed of circulant blocks, together with the use of a compactification…
To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…
Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…
We prove that groups that are mod-p-homology equivalent are isomorphic modulo any term of their derived p-series, in precise analogy to Stallings' 1963 result for the lower-central p-series. Similarly spaces that are mod-p-homology…
Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin \& Gon{\c{c}}alves, 2009), \textsc{L}-shapes (Gon{\c{c}}alves et al, 2018).…
We study the Modular Isomorphism Problem applying a combination of existing and new techniques. We make use of the small group algebra to give a positive answer for two classes of groups of nilpotency class 3. We also introduce a new…
Two major milestones on the road to the full complexity dichotomy for finite-domain constraint satisfaction problems were Bulatov's proof of the dichotomy for conservative templates, and the structural dichotomy for smooth digraphs of…
Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…
We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…
In this paper, we extend the iterated integrals from smooth manifolds to digraphs and develop the associated algebraic and geometric structures. Iterated integrals on a digraph naturally give rise to the iterated path algebra and the…
We describe two BQP-complete problems concerning properties of sparse graphs having a certain symmetry. The graphs are specified by efficiently computable functions which output the adjacent vertices for each vertex. Let i and j be two…
We study the isomorphic implication problem for Boolean constraints. We show that this is a natural analog of the subgraph isomorphism problem. We prove that, depending on the set of constraints, this problem is in P, NP-complete, or…
To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…
A class of differential calculi is explored which is determined by a set of automorphisms of the underlying associative algebra. Several examples are presented. In particular, differential calculi on the quantum plane, the $h$-deformed…
We apply quantitative (or controlled) $K$-theory to prove that a certain $L^p$ assembly map is an isomorphism for $p\in[1,\infty)$ when an action of a countable discrete group $\Gamma$ on a compact Hausdorff space $X$ has finite dynamical…
Idempotent analogues of convexity are introduced. It is proved that the category of algebras for the capacity monad in the category of compacta is isomorphic to the category of $(\max,\min)$-idempotent biconvex compacta and their biaffine…