Related papers: Minimal even sets of nodes
A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a…
A subset of vertices in a graph $G$ is considered a maximal dissociation set if it induces a subgraph with vertex degree at most 1 and it is not contained within any other dissociation sets. In this paper, it is shown that for $n\geq 3$,…
We establish the existence and uniqueness of rational conformal maps of minimal degree $n+1$ for opening up $n$ arcs. In earlier results, the degree was exponential in $n$. We also discuss two related problems. (a) We establish existence of…
We show that directed minimal cones in (n+1)-dimensional Euclidean space which have at most one singularity are - besides the trivial cases: empty set, whole space - half spaces. Using blow-up techniques, this result can be used to get…
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
We improve known upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and non-periodic settings. Some of our bounds are sharp up to logarithmic factors.
The nullity of a graph is the multiplicity of the eigenvalue zero in its adjacency spectrum. In this paper, we give a closed formula for the minimum and maximum nullity among trees with the same degree sequence, using the notion of matching…
We show that a minimal ideal of a finite-dimensional Lie algebra is either simple or abelian.
In this paper, we study a class of toric ideals obtained by using some geometric data of ADE trees which are the minimal resolution graphs of rational surface singularities. We compute explicit Gr\"obner bases for these toric ideals that…
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a…
We study the family of irreducible curves with $\delta$ nodes belonging to a free linear system $|C|$ with smooth general member on a surface $S$ such that $|K_S|$ is ample. Under the assumption that $C$ is numerically equivalent to $pK_S$,…
We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…
An ordered set $S$ of vertices of a graph $G$ is a resolving set for $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of G is the minimum cardinality of a resolving set. In…
We obtain lower bounds for the cardinality of $k$-fold sum-sets of reciprocals of elements of suitable defined short intervals in high degree extensions of finite fields. Combining our results with bounds for multilinear character sums we…
The C-minor partial orders determined by the clones generated by a semilattice operation (and possibly the constant operations corresponding to its identity or zero elements) are shown to satisfy the descending chain condition.
In this paper, we study the regularity of several notions of Lipschitz solutions to the minimal surface system with an emphasis on partial regularity results. These include stationary solutions, integral weak solutions, and viscosity…
The least upper bound on degrees of elements of a minimal system of generators of the algebra of invariants of 3x3 matrices is found, and the nilpotency degree of a relatively free finitely generated algebra with the identity x^3=0 is…
We prove an improvement of flatness result for nonlocal minimal surfaces which is independent of the fractional parameter $s$ when $s\rightarrow 1^-$. As a consequence, we obtain that all the nonlocal minimal cones are flat and that all the…
The identity of the smallest quadrangulation with minimum degree 3 also containing parallel edges is unknown. However, it has already been determined that its order (the number of vertices) is between 11 and 14. This paper narrows this…
We prove new upper bounds for the degrees in Hilbert's Nullstellensatz and for the Noether exponent of polynomial ideals in terms of the monomial structure of the polynomials involved. Our bounds improve the previously known bounds in the…