Related papers: Minimal even sets of nodes

In this paper, we consider complete non-catenoidal minimal surfaces of finite total curvature with two ends. A family of such minimal surfaces with least total absolute curvature is given. Moreover, we obtain a uniqueness theorem for this…

We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…

For the minimal graph defined on a convex ring in the space form with nonnegative curvature, we obtain the regularity and the strict convexity about its level sets by the continuity method.

We compute the minimal cardinality of a covering (resp. an irredundant covering) of a vector space over an arbitrary field by proper linear subspaces. Analogues for affine linear subspaces are also given.

For a given undirected graph $G$, an \emph{ordered} subset $S = {s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in…

Given a nonempty finite multiset $S$ of positive integers, we wish to find a partially ordered set $P$ of minimal cardinality such that the multiset of cardinalities of all maximal chains in $P$ equals $S$. This paper establishes upper and…

We characterize the vertices belonging to all minimum dominating sets, to some minimum dominating sets but not all, and to no minimum dominating set. We refine this characterization for some well studied sub-classes of graphs: chordal,…

In this note, we construct three new infinite families of surfaces of general type with canonical map of degree 2 onto a surface of general type. For one of these families the canonical system has base points.

We observe that a lemma used in the study of even sets of nodes on surfaces applies almost verbatim to prove a celebrated formula of Gauss on the 2-torsion of the class group of a quadratic field.

We prove an inequality for the curvature of level sets of minimal graphs having vanishing boundary values and show that if the boundary is concave, then all the level sets are concave.

Minimal surfaces are ubiquitous in nature. Here they are considered as geometric objects that bear a deformation content. By refining the resolution of the surface deformation gradient afforded by the polar decomposition theorem, we…

In this article we introduce a definition of topological minimal sets, which is a generalization of that of Mumford-Shah-minimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an…

We give a classification of minimal algebras generated in degree 1, defined over any field $\bk$ of characteristic different from 2, up to dimension 6. This recovers the classification of nilpotent Lie algebras over $\bk$ up to dimension 6.…

We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…

We study the minimum rank of a (simple, undirected) graph, which is the minimum rank among all matrices in a space determined by the graph. We determine the exact set of graphs on eight vertices for which the nullity of a minimum rank…

We prove lower bounds on the density of regular minimal cones of dimension less than seven provided the complements of the cones are topologically nontrivial.

Let N be a closed irreducible 3-manifold and assume N is not a graph manifold. We improve for all but finitely many S^1-bundles M over N the adjunction inequality for the minimal complexity of embedded surfaces. This allows us to completely…

We determine the set of catenary degrees, the set of distances, and the unions of sets of lengths of the monoid of nonzero ideals and of the monoid of invertible ideals of orders in quadratic number fields.

In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected…

The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least 0.189n, or at least 0.110n when restricted…