Related papers: Fully reducible simple Venn diagrams

A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…

This work is, in part, a generalization of the article by A.A. Bruen ,T.C Bruen and J.M.McQuillan on Desargues Theorem in arXiv:2007.09175[mathCO]July 17,2020. We prove the extension of Desargues theorem in all dimensions, using 4 different…

We study a relative variant of Serre's notion of $G$-complete reducibility for a reductive algebraic group $G$. We let $K$ be a reductive subgroup of $G$, and consider subgroups of $G$ which normalise the identity component $K^{\circ}$. We…

Extending a classic result of Johnson and Newman, this paper provides a matrix characterization for two generalized cospectral graphs with a pair of generalized cospectral vertex-deleted subgraphs. As an application, we present a new…

Let K be an arbitrary (commutative) field and L be an algebraic closure of it. Let V be a linear subspace of M_n(K), with n>2. We show that if every matrix of V has at most one eigenvalue in K, then dim V<=1+n(n-1)/2. If every matrix of V…

The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector space, without placing any restrictions on the dimension of the space or on the base field. We define a…

Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is…

There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

A parallelohedron is called reducible, if it can be represented as a direct product of two parallelohedra of lower dimension. In his Ph.D. thesis (2005) the first author proved a criterion of reducibility of a parallelohedron in terms of…

In this work, we introduce and develop a theory of convex drawings of the complete graph $K_n$ in the sphere. A drawing $D$ of $K_n$ is convex if, for every 3-cycle $T$ of $K_n$, there is a closed disc $\Delta_T$ bounded by $D[T]$ such…

We consider finite pencils of Jacobi matrices \[ J_n(w)=A+wB, \] where $A$ is diagonal and $B$ is tridiagonal with zero diagonal. The spectral curve is the affine plane curve \[ \chi_n(\lambda,w)=\det(\lambda I+J_n(w))=0 . \] The main…

When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…

Following a line of research initiated in \cite{BBNN}, I describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cicho\'n diagram for cardinal characteristics of the…

Asymmetric vector norms are generalizations of asymmetric norms, where the subadditivity inequality is understood in ordered vector space sense. This relation imposes strong conditions on the ordering itself. This note studies on these…

We consider supervised learning (regression/classification) problems with tensor-valued input. We derive multi-linear sufficient reductions for the regression or classification problem by modeling the conditional distribution of the…

We discuss various necessary and sufficient conditions for the complete reducibility of a ternary cubic form. In doing so, we prove the claim made in the 19th century that such a form is completely reducible if and only if its Hessian is a…

A graph is closed when its vertices have a labeling by $[n]$ such that the binomial edge ideal $J_G$ has a quadratic Gr\"{o}bner basis with respect to the lexicographic order induced by $x_1 > \cdots > x_n > y_1> \cdots > y_n$. In this…

In this paper, we propose a novel lower dimensional representation of a shape sequence. The proposed dimension reduction is invertible and computationally more efficient in comparison to other related works. Theoretically, the differential…

We prove that a normal vector field along a curve in R3 is rotation minimizing (RM) if and only if it is parallel respect to the normal connection. This allows us to generalize all the results of RM vectors and frames to curves immersed in…