Related papers: Fully reducible simple Venn diagrams

We describe the class of quiver settings with one dimensional vertices whose semi-simple representations are parametrized by a complete intersection variety. We show that these quivers can be reduced to a one vertex quiver with some…

Reductions---rules that reduce input size while maintaining the ability to compute an optimal solution---are critical for developing efficient maximum independent set algorithms in both theory and practice. While several simple reductions…

A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with $n$ vertices on an $O(n^{1.5})…

A $k$-regular graph on $v$ vertices is a {\em divisible design graph} if there exist integers $\lambda_1,\lambda_2,m,n$ such that the vertex set can be partitioned into $m$ classes of size $n$ and any two different vertices from the same…

We introduce an evolving-plane ansatz for the explicit construction of entire minimal graphs of dimension $n$ ($n\geq 3$) and codimension $m$ ($m\geq 2$), for any odd integer $n$. Under this ansatz, the minimal surface system reduces to the…

Let End(V) denote the ring of all linear transformations of an arbitrary k-vector space V over a field k. We define a subset X of End(V) to be "triangularizable" if V has a well-ordered basis such that X sends each vector in that basis to…

Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…

Let G be a connected reductive algebraic group defined over an algebraically closed field of positive characteristic. We study a generalization of the notion of G-complete reducibility in the context of Steinberg endomorphisms of G. Our…

We give a complete description of the cone of Betti diagrams over a standard graded hypersurface ring of the form k[x,y]/<q>, where q is a homogeneous quadric. We also provide a finite algorithm for decomposing Betti diagrams, including…

This work classifies three-dimensional simple evolution algebras over arbitrary fields. For this purpose, we use tools such as the associated directed graph, the moduli set, inductive limit group, Zariski topology and the dimension of the…

We extend the well-known formula for the Euler class of a real oriented even-dimensional vector bundle in terms of the curvature of a metric connection to the case of a general linear connection provided a metric is present. We rewrite the…

Supersymmetry, shape invariance, exact solubility, and the factorization method are often studied together in the literature. At the dawn of these topics confusion was present in regards to their scope of applicability and the relation…

We discuss reductions of general N=1 four dimensional gauge theories on S^2. The effective two dimensional theory one obtains depends on the details of the coupling of the theory to background fields, which can be translated to a choice of…

Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…

The aim of this paper is to give two complete and simple characterizations of Minkowski norms N on an arbitrary topological real vector space such that the sublevel sets of N are strictly convex. We first show that this property is…

We perform a general reduction of an M5-brane on a spacetime that admits a null Killing vector, including couplings to background 4-form fluxes and possible twisting of the normal bundle. We give the non-abelian extension of this action and…

We restate the semistable reduction theorem from geometric invariant theory in the context of spaces of morphisms on $\mathbb{P}^{n}$. For every complete curve $C$ downstairs, we get a $\mathbb{P}^{n}$-bundle on an abstract curve $D$…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

For a simple drawing $D$ of the complete graph $K_n$, two (plane) subdrawings are compatible if their union is plane. Let $\mathcal{T}_D$ be the set of all plane spanning trees on $D$ and $\mathcal{F}(\mathcal{T}_D)$ be the compatibility…

We extend Lorentz-violating Supersymmetry models to include vector superfields. The CPT-preserving model generalizes easily, while the obvious attempt at generalizing the CPT-violating model meets serious obstructions. Generalizations of…