Related papers: Minimal plus-one generated line arrangements with …
In this paper we show how some known weak forms of the Zilber--Pink conjecture can be strengthened by combining them with the Mordell--Lang conjecture or its variants. We illustrate this idea by proving some theorems on atypical…
We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation, therefore generalizing previous works in the…
A simple construction is presented, which generalises piecewise linear one-dimensional Markov maps to an arbitrary number of dimensions. The corresponding coupled map lattice, known as a simplicial mapping in the mathematical literature,…
In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…
We study minimal generating subspaces of "weak PBW type" for vertex operator algebras that satisfy a certain condition on the grading, and we develop a procedure for finding such subspaces. As applications, we derive some results on…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…
We will use toric degenerations of the projective plane ${{\mathbb{P}}^ 2}$ to give a new proof of the triple points interpolation problems in the projective plane. We also give a complete list of toric surfaces that are useful as…
We provide a structure theorem for all almost complete intersection ideals of depth three in any Noetherian local ring. In particular, we find that the minimal generators are the pfaffians of suitable submatrices of an alternating matrix.…
In the present article, we show the existence of a coupled fixed point for an order preserving mapping in a preordered left K-complete quasi-pseudometric space using a preorder induced by an appropriate function. We also define the concept…
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes,…
We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…
In this paper, we discuss the minimal surfaces over the slanted half-planes, vertical strips, and single slit whose slit lies on the negative real axis. The representation of these minimal surfaces and the corresponding harmonic mappings…
Let A be a finite non-singleton set. For |A|=2 we show that the partial clone consisting of all selfdual monotone partial functions on A is not finitely generated, while it is the intersection of two finitely generated maximal partial…
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
In this article we investigate the question of finding a network configuration of minimal length connecting three given points in the Heisenberg group. After proving existence of (possibly degenerate) minimal horizontal triods, we…
We associate curves of isotropic, Lagrangian and coisotropic subspaces to higher order, one parameter variational problems. Minimality and conjugacy properties of extremals are described in terms of these curves.
We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge…
Observing a linear superposition principle, a family of new minimal hypersurfaces in Euclidean space is found, as well as that linear combinations of generalized helicoids induce new algebraic minimal cones of arbitrarily high degree.