Related papers: Le logo du CNRS est-il convexe ?
Carath\'eodorys Theorem of convex hulls plays an important role in convex geometry. In 1982, B\'ar\'any formulated and proved a more general version, called the Colorful Carath\'eodory. This colorful version was even more generalized by…
Rotation invariance and translation invariance have great values in image recognition tasks. In this paper, we bring a new architecture in convolutional neural network (CNN) named cyclic convolutional layer to achieve rotation invariance in…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Scientists have long preferred the simplest possible explanation of their data. More re-cently, a worrying trend to favor complex interpretations has taken hold because they are perceived as more impactful.
The Random Geometric Graph (RGG) is a random graph model for network data with an underlying spatial representation. Geometry endows RGGs with a rich dependence structure and often leads to desirable properties of real-world networks such…
We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…
The neutron is electrically neutral, but its substructure consists of charged quarks so it may have an internal charge distribution. In fact it is known to have a negative mean square charge radius (MSCR), the second moment of the radial…
The aim of this paper is to present some properties of reduced spherical convex bodies on the two-dimensional sphere $S^2$. The intersection of two different non-opposite hemispheres is called a lune. By its thickness we mean the distance…
A non-algorithmic, generalized version of a recent result, asserting that a natural relaxation of the Koml\'os conjecture from boolean discrepancy to spherical discrepancy is true, is proved by a very short argument using convex geometry.
In various approaches, data cubes are pre-computed in order to answer efficiently OLAP queries. The notion of data cube has been declined in various ways: iceberg cubes, range cubes or differential cubes. In this paper, we introduce the…
Quasi-simultaneous optical/near-IR photometry is presented for a sample of 37 luminous optically selected QSOs drawn from the Large Bright QSO Survey. Most of the QSOs have decreased in brightness since discovery; this is expected in…
An orbitope is the convex hull of an orbit of a point under the action of a compact group. We derive bounds on volumes of sections of polar bodies of orbitopes, extending our previously developed methods. As an application we realize the…
Shape learning, or the ability to leverage shape information, could be a desirable property of convolutional neural networks (CNNs) when target objects have specific shapes. While some research on the topic is emerging, there is no…
We propose a new approach to the study of compact Riemannian manifolds with nonnegative Ricci curvature and strictly convex boundary or positive Ricci curvature and convex boundary. Several conjectures are formulated. Some partial results…
This text is a short but comprehensive introduction to the basics of supergeometry and includes some of the recent advances in colored supergeometry. We do not aim for a standard text that states results and proves them more or less…
We study the pseudohermitian sectional curvature of a CR manifold.
In this paper, we introduce round and sleek topological spaces and study their properties.
Chandra images of the Crab Nebula resolve the detailed structure of its "inner ring", possibly a termination shock where pulsar-accelerated relativistic particles begin to emit X radiation. Analysis of these images finds that the center of…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…
Covering numbers of convex bodies based on homothetical copies and related illumination numbers are well-known in combinatorial geometry and, for example, related to Hadwiger's famous covering problem. Similar numbers can be defined by…