Related papers: A Well-Defined Jellyfish Algorithm for the Affine …
The \emph{Product Structure Theorem} for planar graphs (Dujmovi\'c et al.\ \emph{JACM}, \textbf{67}(4):22) states that any planar graph is contained in the strong product of a planar $3$-tree, a path, and a $3$-cycle. We give a simple…
We generalize to the super context, the known fact that if an affine algebraic group $G$ over a commutative ring $k$ acts freely (in an appropriate sense) on an affine scheme $X$ over $k$, then the dur sheaf $X\tilde{\tilde{/}}G$ of…
In this note we study in a finite dimensional Lie algebra ${\mathfrak g}$ the set of all those elements x for which the closed convex hull of the adjoint orbit contains no affine lines; this contains in particular elements whose adjoint…
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
We realize the fundamental representations of quantum algebras via the supersymmetric Higgs mechanism in gauge theories with 8 supercharges on an $\Omega$-background. We test our proposal for quantum affine algebras, by probing the Higgs…
In this paper we continue the work of Kalnins et al in classifying all second-order conformally-superintegrable (Laplace-type) systems over conformally flat spaces, using tools from algebraic geometry and classical invariant theory. The…
We give conceptual proofs of certain basic properties of the arrangement of shifted root hyperplanes associated to a root system and a Weyl group invariant real valued parameter function on the root system. The method is based on the role…
Research of cycles through specific vertices is a central topic in graph theory. In this context, we focus on a well-studied computational problem, \textsc{$T$-Cycle}: given an undirected $n$-vertex graph $G$ and a set of $k$ vertices…
We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach…
When the inverse of an algorithm is well-defined -- that is, when its output can be deterministically transformed into the input producing it -- we say that the algorithm is invertible. While one can describe an invertible algorithm using a…
Growing out of the initial connections between subfactors and knot theory that gave rise to the Jones polynomial, Jones' axiomatization of the standard invariant of an extremal finite index $II_1$ subfactor as a spherical $C^*$-planar…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
Let $J\subset S=K[x_0,...,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of the homogeneous polynomial ideals $I$, such that the monomials outside $J$ form a $K$-vector basis of $S/I$, is called a {\em $J$-marked…
We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all…
Extended affine root systems appear as the root systems of extended affine Lie algebras. A subclass of extended affine root systems, whose elements are called ``minimal" turns out to be of special interest mostly because of the geometric…
The paradigms of transformational planning, case-based planning, and plan debugging all involve a process known as plan adaptation - modifying or repairing an old plan so it solves a new problem. In this paper we provide a…
This study presents constructions of the space-time Conservation Element and Solution Element (CESE) methods to accommodate adaptive unstructured quadrilateral meshes. Subsequently, a novel algorithm is devised to effectively manage the…
We present a sublinear query algorithm for outputting a near-optimal low-rank approximation to any positive semidefinite Toeplitz matrix $T \in \mathbb{R}^{d \times d}$. In particular, for any integer rank $k \leq d$ and $\epsilon,\delta >…
In this article, we give a simple explicit construction of an affine slice for the coadjoint action of a certain class of biparabolic (also called seaweed) subalgebras of a semisimple Lie algebra over an algebraically closed field of…
We study the affine schemes of modules over gentle algebras. We describe the smooth points of these schemes, and we also analyze their irreducible components in detail. Several of our results generalize formerly known results, e.g. by…