Related papers: Fully reducible simple Venn diagrams

Let $f:V\times V\to F$ be a totally arbitrary bilinear form defined on a finite dimensional vector space $V$ over a a field $F$, and let $L(f)$ be the subalgebra of $\gl(V)$ of all skew-adjoint endomorphisms relative to $f$. Provided $F$ is…

Venn diagrams are a graphical way to represent a set system. Each of the n sets is represented by a simple closed curve. The n curves subdivide the plane into 2^n open connected regions, each of which represents the intersection of its…

We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of convex k-gons, we prove that k >= (2^n - 2 - n) / (n (n-2)). In the…

In 1984, Winkler conjectured that every simple Venn diagram with $n$ curves can be extended to a simple Venn diagram with $n+1$ curves. His conjecture is equivalent to the statement that the dual graph of any simple Venn diagram has a…

A symmetric Venn diagram is one that is invariant under rotation, up to a relabeling of curves. A simple Venn diagram is one in which at most two curves intersect at any point. In this paper we introduce a new property of Venn diagrams…

It is well-known that if a real valued function acting on a convex set satisfies the $n$-variable Jensen inequality, for some natural number $n\geq 2$, then, for all $k\in\{1,\dots, n\}$, it fulfills the $k$-variable Jensen inequality as…

An $n$-Venn diagram is a certain collection of $n$ simple closed curves in the plane. They can be regarded as graphs where the points of intersection are vertices and the curve segments between points of intersection are edges. Every…

An $n$-Venn diagram is a diagram in the plane consisting of $n$ simple closed curves that intersect only finitely many times such that each of the $2^n$ possible intersections is represented by a single connected region. An $n$-Venn diagram…

We introduce and study a generalized concept of boundedness of a subset of a normed vector space with respect to a cone, which is defined as lower boundedness of the images of the underlying set through all the positive functionals of the…

A graph is reducible if it is the lexicographic product of two smaller non-trivial graphs. It is well-known a 1-planar graph with $n ~(\ge3)$ vertices has at most $4n-8$ edges, and a graph $G$ with $n$ vertices is optimal if $G$ has exactly…

We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of external momenta, that reducibility with respect to both…

It is well known that in $n$-dimensional Euclidean space ($n\geq 2$) the classes of (diametrically) complete sets and of bodies of constant width coincide. Due to this, they both form a proper subfamily of the class of reduced bodies. For…

We study convexity of image of a general multidimensional quadratic map. We split the full image into two parts by an appropriate hyperplane such that one part is compact, and formulate a sufficient condition for convexity of the compact…

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills certain rather specific constraints on how the edges are…

This paper investigates scalable frame in ${\mathbb R}^n$. We define the reduced diagram matrix of a frame and use it to classify scalability of the frame under some conditions. We give a new approach to the scaling problem by breaking the…

Inclusion diagrams are introduced as an alternative to using Venn diagrams to determine the validity of categorical syllogisms, and are used here for the analysis of diverse categorical syllogisms. As a preliminary example of a possible…

In this paper, we prove that the variety $C_m(L)$ of commuting $m$-tuples of elements of simple Lie algebra $L$ is often reducible. Explicitely, we prove it is reducible for all simple Lie algebra $L$ not isomorphic to $\mathfrak{sl}_2$ and…

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…

We generalize a result of Serre's to show that if every vertex of some fixed type of a convex subcomplex of an irreducible spherical building has an opposite, then the subcomplex is completely reducible.