Related papers: Virial Expansion Bounds Through Tree Partition Sch…

Recently it has been shown that the heuristic Rosenfeld functional derives from the virial expansion for particles which overlap in one center. Here, we generalize this approach to any number of intersections. Starting from the virial…

Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving…

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

We reprove three known algorithmic bounds for terminal-clustering problems, using a single framework that leads to simpler proofs. In this genre of problems, the input is a metric space $(X,d)$ (possibly arising from a graph) and a subset…

We introduce a class of combinatorial hypersurfaces in the complex projective space. They are submanifolds of codimension~2 in $\C P^n$ and are topologically "glued" out of algebraic hypersurfaces in $(\C^*)^n$. Our construction can be…

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…

We consider a system of particles confined in a box $\La\subset\R^d$ interacting via a tempered and stable pair potential. We prove the validity of the cluster expansion for the canonical partition function in the high temperature - low…

We study two problems that seek a subtree $T$ of a graph $G=(V,E)$ such that $T$ satisfies a certain property and has minimal maximum degree. - In the Min-Degree Group Steiner Tree problem we are given a collection ${\cal S}$ of groups…

We prove sharp bounds on the enstrophy growth in viscous scalar conservation laws. The upper bound is, up to a prefactor, the enstrophy created by the steepest viscous shock admissible by the $L^\infty$ and total variation bounds and…

This paper is concerned with growth series for expansion complexes for finite subdivision rules. Suppose X is an expansion complex for a finite subdivision rule with bounded valence and mesh approaching 0, and let S be a seed for X. One can…

Gradient schemes is a framework which enables the unified convergence analysis of many different methods -- such as finite elements (conforming, non-conforming and mixed) and finite volumes methods -- for $2^{\rm nd}$ order diffusion…

We obtain a concentration inequality for the maximum degree of a vertex in a uniformly random dissection of a polygon. This resolves a conjecture posed by Curien and Kortchemski in 2012. Our approach is based on a bijection with dual trees…

Decision trees and randomized forests are widely used in computer vision and machine learning. Standard algorithms for decision tree induction optimize the split functions one node at a time according to some splitting criteria. This greedy…

We consider drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons. Among all such drawings we seek the one maximizing the angular…

The notion of shortcut partition, introduced recently by Chang, Conroy, Le, Milenkovi\'c, Solomon, and Than [CCLMST23], is a new type of graph partition into low-diameter clusters. Roughly speaking, the shortcut partition guarantees that…

Let $k$, $d$ be a positive integer, $G$ be a connected graph of order $n$, $T$ be a tree. The leaf distance of a tree is defined as the minimum distance between any two leaves. For $v\in V(T)$, the leaf degree of $v$ in $T$ is the number of…

We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The exchange property of the matroid bases immediately yields…

We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…

In this paper, the geometric approach to the virial theorem developed in \cite{CFR12} is written in terms of quasi-velocities (see \cite{CNCS07}). A generalization of the virial theorem for mechanical systems on Lie algebroids is also…

We consider the Voronoi tessellation based on a homogeneous Poisson point process in $\mathbf{R}^{d}$. For a geometric characteristic of the cells (e.g. the inradius, the circumradius, the volume), we investigate the point process of the…