Search
Search Results
-
Discrete Morse Theory for Computing Zigzag Persistence
We introduce a theoretical and computational framework to use discrete Morse theory as an efficient preprocessing in order to compute zigzag...
-
Correction to: Avoiding the Global Sort: A Faster Contour Tree Algorithm
This erratum points out a serious bug in our paper, “Avoiding the global sort: a faster contour tree algorithm” (Discrete Comput. Geom. 58 (4),...
-
The Discrete Approximation Problem for a Special Case of Hermite-Type Polynomial Interpolation
Every univariate Hermite interpolation problem can be written as a pointwise limit of Lagrange interpolants. However, this property is not preserved...
-
The Discrete Orlicz-Minkowski Problem for p-Capacity
In this paper, we demonstrate the existence part of the discrete Orlicz-Minkowski problem for p -capacity when 1 < p < 2.
-
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices
We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of d /2 in...
-
Almost Sharp Bounds on the Number of Discrete Chains in the Plane
The following generalisation of the Erdős Unit Distance problem was recently suggested by Palsson, Senger, and Sheffer. For a fixed sequence δ = ( δ 1 ,...
-
Power Mean Inequalities and Sums of Squares
We study the limits of the cones of symmetric nonnegative polynomials and symmetric sums of squares, when expressed in power-mean or monomial-mean...
-
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of...
-
List of Publications for László Lovász
[1] On graphs not containing independent circuits. Mat. Lapok, 16:289–299 (in Hungarian).
-
Adaptive and local regularization for data fitting by tensor-product spline surfaces
We propose to employ a non-constant regularization weight function (RWF) for data fitting via least-squares tensor-product (TP) spline fitting. In...
-
Multiparameter Persistent Homology
In Carlsson and Zomorodian (Discr Comput Geom 42, 71–93, 2009), Carlsson–Zomorodian introduced an extension of persistent homology to the setting of...
-
Tree-Partitions with Bounded Degree Trees
A tree-partition of a graph G is a partition of V(G) such that identifying the vertices in each part gives a tree. It is known that every graph with...
-
List of Publications for Avi Wigderson
[1] A new approximate graph coloring algorithm. Proceedings of the Annual ACM Symposium on Theory of Computing, 1982, 325–329. [2] The Complexity of...
-
Chasing Convex Bodies Optimally
In the chasing convex bodies problem, an online player receives a request sequence of N convex sets...
-
Tammes Problem and Contact Number for Spheres in Spaces of Constant Curvature
In this paper, we consider the problem on the contact number of a sphere in a three-dimensional hyperbolic space and a three-dimensional spherical...
-
Old and new challenges in Hadamard spaces
Hadamard spaces have traditionally played important roles in geometry and geometric group theory. More recently, they have additionally turned out to...
-
How do 9 Points Look Like in \(\mathbb {E}^3\)?
The aim of this note is to give an elementary proof of the following fact: given three red convex sets and three blue convex sets in
... -
The Logarithmic Capacitary Minkowski Problem for Polytopes
The logarithmic capacitary Minkowski problem asks for necessary and sufficient conditions on a finite Borel measure on the unit sphere so that it is...