Related papers: Rigidity of Circle Packings with Crosscuts
We show, using standard results in length spectrum rigidity and symplectic homology, that if the unit tangent bundles of two compact surfaces of negative curvature are exact symplectomorphic, then the underlying surfaces are isometric, and…
We define the strong shortcut property for rough geodesic metric spaces, generalizing the notion of strongly shortcut graphs. We show that the strong shortcut property is a rough similarity invariant. We give several new characterizations…
Containers conveniently represent a wide class of inductive data types. Their derivatives compute representations of types of one-hole contexts, useful for implementing tree-traversal algorithms. In the category of containers and cartesian…
We extend the celebrated rigidity of the sharp first spectral gap under $Ric\ge0$ to compact infinitesimally Hilbertian spaces with non-negative (weak, also called synthetic) Ricci curvature and bounded (synthetic) dimension i.e. to…
In this paper, we aim to provide a notion of "relative objects", i.e. objects equipped with some sort of subobjects, in differential topology. In spite of active researches relating them, e.g. knot theory or the theory of manifolds with…
The boundedness and compactness of weighted composition operators on the Hardy space ${\mathcal H}^2$ of the unit disc is analysed. Particular reference is made to the case when the self-map of the disc is an inner function. Schatten-class…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
Despite its long history, there are many fundamental issues concerning random packings of spheres that remain elusive, including a precise definition of random close packing (RCP). We argue that the current picture of RCP cannot be made…
We investigate criteria for circle packing(CP) types of disk triangulation graphs embedded into simply connected domains in $ \mathbb{C}$. In particular, by studying combinatorial curvature and the combinatorial Gauss-Bonnet theorem…
We prove a transversality "lifting property" for compactified configuration spaces as an application of the multijet transversality theorem: the submanifold of configurations of points on an arbitrary submanifold of Euclidean space may be…
Understanding the topology of decision regions is central to explaining the inner workings of deep neural networks. Prior empirical work has provided evidence that these regions are path connected. We study a stronger topological question:…
A set $S$ of vertices in a graph is an open packing if (open) neighborhoods of any two distinct vertices in $S$ are disjoint. In this paper, we consider the graphs that have a unique maximum open packing. We characterize the trees with this…
Many clustering algorithms when the data are curves or functions have been recently proposed. However, the presence of contamination in the sample of curves can influence the performance of most of them. In this work we propose a robust,…
The fixed-circle problem is a recent problem about the study of geometric properties of the fixed point set of a self-mapping on metric (resp. generalized metric) spaces. The fixed-disc problem occurs as a natural consequence of this…
Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…
We study the connections between three seemingly different combinatorial structures - "uniform" brackets in statistics and probability theory, "containers" in online and distributed learning theory, and "combinatorial Macbeath regions", or…
A new elementary proof for a theorem of D. Burns and S. Krantz on the rigidity of the analytic self maps of the unit disc was recently discovered by L. Baracco, D. Zaitsev, and G. Zampieri. We use their argument to generalize Burns-Krantz…
Two discrete dynamical systems are discussed and analyzed whose trajectories encode significant explicit information about a number of problems in combinatorial probability, including graphical enumeration on Riemann surfaces and random…
We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…
We consider the irregular strip packing problem of rasterized shapes, where a given set of pieces of irregular shapes represented in pixels should be placed into a rectangular container without overlap. The rasterized shapes provide simple…