Related papers: One-dimensional minimal fillings with negative edg…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
We prove that in a Riemannian manifold $M$, each function whose Hessian is proportional the metric tensor yields a weighted monotonicity theorem. Such function appears in the Euclidean space, the round sphere $S^n$ and the hyperbolic space…
The purpose of this report is to acknowledge the influence of M. Gromov's vision of geometry on our own works. It is two-fold: in the first part we aim at describing some results, in dimension 3, around the question: which open 3-manifolds…
We find classes of projective manifolds that are elliptic in the sense of Gromov and such that the affine cones over these manifolds also are elliptic off their vertices. For example, the latter holds for any generalized flag manifold of…
In any dimension at least five we construct examples of closed smooth manifolds with the following properties: 1) they have neither real projective nor flat conformal structures; 2) their fundamental group is a non-elementary Gromov…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…
The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…
The $G$-parking function ideal $M_G$ of a directed multigraph $G$ is a monomial ideal which encodes some of the combinatorial information of $G$. It is an initial ideal of the toppling ideal $I_G$, a lattice ideal intimately related to the…
Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
We consider a geometrical system of equations for a three dimensional Riemannian manifold. This system of equations has been constructed as to include several physically interesting systems of equations, such as the stationary Einstein…
The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…
Let $(M,g)$ be a complete $(n+1)$-dimensional Riemannian manifold with $2\leq n\leq 6$. Our main theorem generalizes the solution of S.-T. Yau's conjecture on the abundance of minimal surfaces and builds on a result of M. Gromov. Suppose…
We consider a complete nonnegative biminimal submanifold M (that is, a complete biminimal submanifold with lambda>=0) in a Euclidean space E^N. Assume that the immersion is proper, that is, the preimage of every compact set in E^N is also…
For several instances of metric largeness like enlargeability or having hyperspherical universal covers, we construct non-large vector subspaces in the rational homology of finitely generated groups. The functorial properties of this…
Gromov and Sormani conjectured that sequences of compact Riemannian manifolds with nonnegative scalar curvature and area of minimal surfaces bounded below should have subsequences which converge in the intrinsic flat sense to limit spaces…
We study finite foldable cubical complexes of nonpositive curvature (in the sense of A.D. Alexandrov). We show that such a complex X admits a graph of spaces decomposition. It is also shown that when dim X=3, X contains a closed rank one…
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…
We consider the minimum weight and smallest weight minimum-size dominating set problems in vertex-weighted graphs and networks. The latter problem is a two-objective optimization problem, which is different from the classic minimum weight…