Related papers: The complexity of matroid homomorphism reconfigura…

Let M be a 2n-dimensional Kahler manifold deformation equivalent to the Hilbert scheme of length n subschemes of a K3 surface S. Let Mon be the group of automorphisms of the cohomology ring of M, which are induced by monodromy operators.…

In the problem ${\rm Mix}(H)$ one is given a graph $G$ and must decide if the Hom-graph ${\rm {\bf Hom}}(G,H)$ is connected. We show that if $H$ is a triangle-free reflexive graph with at least one cycle, ${\rm Mix}(H)$ is ${\rm…

We consider a generalization of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$, HOM($H$). In this setting, we are given an input digraph $G$ together with a list function from $G$ to $2^H$. The goal is to find a…

Homographies are among the most prevalent transformations occurring in geometric computer vision and projective geometry, and homography estimation is consequently a crucial step in a wide assortment of computer vision tasks. When working…

The prism graph is the dual of the complete graph on five vertices with an edge deleted, $K_5\backslash e$. In this paper we determine the class of binary matroids with no prism minor. The motivation for this problem is the 1963 result by…

Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…

We consider the problem of symmetrising a neural network along a group homomorphism: given a homomorphism $\varphi : H \to G$, we would like a procedure that converts $H$-equivariant neural networks to $G$-equivariant ones. We formulate…

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

In this article, we solve the equivalence problem for 2--nondegenerate CR geometries that have (at every point) a homogeneous space $G/H$ as a maximally symmetric model for $G$ simple real Lie group of CR automorphisms. This completes the…

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…

For a symmetric 2t-cycle in the tope graph of a simple oriented matroid M on the ground set {1,...,t}, where t is even, we describe decompositions of topes and subtopes of M with respect to the subtopes corresponding to the edges of the…

This paper is motivated by the fact that many systems need to be maintained continually while the underlying costs change over time. The challenge is to continually maintain near-optimal solutions to the underlying optimization problems,…

We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism $\phi$ between two isomorphic graphs is as hard as computing $\phi$ itself. This result optimally improves upon a result of G\'{a}l et al.…

We set up the formalism of holographic renormalization for the matter-coupled two-dimensional maximal supergravity that captures the low-lying fluctuations around the non-conformal D0-brane near-horizon geometry. As an application we…

In this work we consider the {\em image matching} problem for two grayscale $n \times n$ images, $M_1$ and $M_2$ (where pixel values range from 0 to 1). Our goal is to find an affine transformation $T$ that maps pixels from $M_1$ to pixels…

Starting from Borel's description of the mod-2 cohomology of real flag manifolds, we give a minimal presentation of the cohomology ring for semi complete flag manifolds $F_{k,m}:=F(1,\ldots,1,m)$ where $1$ is repeated $k$ times. The…

We prove a theorem on equivariant maps implying the following two corollaries: (1) Let N and M be compact orientable n-manifolds with boundaries such that M\subset N, the inclusion M\to N induces an isomorphism in integral cohomology, both…

Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in approximately half of the traps being filled. To consolidate…

Cographs are graphs in which no four vertices induce a simple connected path $P_4$. Cograph editing is to find for a given graph $G = (V,E)$ a set of at most $k$ edge additions and deletions that transform $G$ into a cograph. This…

We prove a general result concerning cyclic orderings of the elements of a matroid. For each matroid $M$, weight function $\omega:E(M)\rightarrow\mathbb{N}$, and positive integer $D$, the following are equivalent. (1) For all $A\subseteq…