Related papers: Not all simplicial polytopes are weakly vertex-dec…

The classical (vertex) metric dimension of a graph G is defined as the cardinality of a smallest set S in V (G) such that any two vertices x and y from G have different distances to least one vertex from S: The k-metric dimension is a…

We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log^{3/2}n)$. This…

Let $X$ be a simplicial complex on vertex set $V$. We say that $X$ is $d$-representable if it is isomorphic to the nerve of a family of convex sets in $\mathbb{R}^d$. We define the $d$-boxicity of $X$ as the minimal $k$ such that $X$ can be…

A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

A bridge sphere is said to be keen weakly reducible if it admits a unique pair of disjoint compressing disks on opposite sides. In particular, such a bridge sphere is weakly reducible, not perturbed, and not topologically minimal in the…

The notion of weak tiling played a key role in the proof of Fuglede's spectral set conjecture for convex domains, due to the fact that every spectral set must weakly tile its complement. In this paper, we revisit the notion of weak tiling…

A simplicial complex $\Delta$ is called flag if all minimal nonfaces of $\Delta$ have at most two elements. The following are proved: First, if $\Delta$ is a flag simplicial pseudomanifold of dimension $d-1$, then the graph of $\Delta$ (i)…

The isotropic constant $L_K$ is an affine-invariant measure of the spread of a convex body $K$. For a $d$-dimensional convex body $K$, $L_K$ can be defined by $L_K^{2d} = \det(A(K))/(\mathrm{vol}(K))^2$, where $A(K)$ is the covariance…

Let M be a matrix whose entries are power series in several variables and determinant det(M) does not vanish identically. The equation det(M)=0 defines a hypersurface singularity and the (co)-kernel of M is a maximally Cohen-Macaulay module…

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

We extend the criterion of Kawatani and Okawa for indecomposability of the derived category of a smooth projective variety to arbitrary schemes. For relative schemes, we also give a criterion for the nonexistence of semiorthogonal…

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…

Deformation properties of weakly bound nuclei are discussed in the deformed single-particle model. It is demonstrated that in the limit of a very small binding energy the valence particles in specific orbitals, characterized by a very small…

The weak $k$-metric dimension of a graph is roughly understood as the cardinality of a smallest set of vertices $S$ of the graph with the property of uniquely recognizing all the vertices of the graph throughout summations of differences of…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

We introduce pretty $k$-clean monomial ideals and $k$-decomposable multicomplexes, respectively, as the extensions of the notions of $k$-clean monomial ideals and $k$-decomposable simplicial complexes. We show that a multicomplex $\Gamma$…

Let $\Delta(d,n)$ denote the maximum diameter of a $d$-dimensional polyhedron with $n$ facets. In this paper, we propose a unified analysis of a recursive inequality about $\Delta(d,n)$ established by Kalai and Kleitman in 1992. This yields…

We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach…

The present paper is intended to provide the basis for the study of weakly differentiable functions on rectifiable varifolds with locally bounded first variation. The concept proposed here is defined by means of integration by parts…