Related papers: Isoperimetric Inequalities using Varopoulos Transp…
Shephard (Canad. J. Math. 26: 302-321, 1974) proved a decomposition theorem for zonotopes yielding a simple formula for their volume. In this note we prove a generalization of this theorem yielding similar formulas for their intrinsic…
The general position problem in graphs is to find the maximum number of vertices that can be selected such that no three vertices lie on a common shortest path. The mutual-visibility problem in graphs is to find the maximum number of…
This paper estimates the location and the width of the nodal set of the first Neumann eigenfunctions on a smooth convex domain $\Omega \subset \mathbb R^n$, whose length is normalized to be 1 and whose cross-section is contained in a ball…
Many algorithms require discriminative boundaries, such as separating hyperplanes or hyperballs, or are specifically designed to work on spherical data. By applying inversive geometry, we show that the two discriminative boundaries can be…
In this paper, we consider an incompressible viscous flow without surface tension in a finite-depth domain of three dimensions, with free top boundary and fixed bottom boundary. This system is governed by a Naiver-Stokes equation in above…
Consider neutron transport equations in 3D convex domains with in-flow boundary. We mainly study the asymptotic limits as the Knudsen number $\epsilon\rightarrow 0^+$. Using Hilbert expansion, we rigorously justify that the solution of…
Take a riemanniann nilmanifold, lift its metric on its universal cover. In that way one obtains a metric invariant under the action of some co-compact subgroup. We use it to define metric balls and then study the spectrum of the laplacian…
The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter…
We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…
This paper is devoted to one-dimensional interpolation Gagliardo-Nirenberg-Sobolev inequalities. We study how various notions of duality, transport and monotonicity of functionals along flows defined by some nonlinear diffusion equations…
The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…
Carrier graphs were first introduced for closed hyperbolic 3-manifolds by White. In this paper, we first generalize this definition to carrier graphs for representations of a rank two free group into the isometry group of hyperbolic three…
Dehn fillings for relatively hyperbolic groups generalize the topological Dehn surgery on a non-compact hyperbolic $3$-manifold such as a hyperbolic knot complement. We prove a rigidity result saying that if two non-elementary relatively…
We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…
Nonlocal metric dimension ${\rm dim}_{\rm n\ell}(G)$ of a graph $G$ is introduced as the cardinality of a smallest nonlocal resolving set, that is, a set of vertices which resolves each pair of non-adjacent vertices of $G$. Graphs $G$ with…
We study the discrete graph-metric analogue of Gromov's filling area problem for the cycle graph \(C_n\). An abstract triangulation \(K\) is an isometric filling of \(C_n\) if \(\partial K=C_n\) and the graph distance between any two…
This article gives an introduction to optimal transport, a mathematical theory that makes it possible to measure distances between functions (or distances between more general objects), to interpolate between objects or to enforce…
In recent years, high-order finite element methods on high-order meshes have attracted considerable attention. This work investigates the isoparametric upwind discontinuous Galerkin method for the radiation transport equation on a bounded…
In this work the Isoperimetric Inequality for integral varifolds is used to obtain sharp estimates for the size of the set where the density quotient is small and to generalise Calder\'on's and Zygmund's theory of first order…
We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…