Related papers: Simplicial approximation and complexity growth
The paper is devoted to the study of a new class of optimal control problems governed by discontinuous constrained differential inclusions of the sweeping type with involving the duration of the dynamic process into optimization. We develop…
We propose an extrapolation technique that allows accuracy improvement of the discrete dipole approximation computations. The performance of this technique was studied empirically based on extensive simulations for 5 test cases using many…
We give a condition on the curvature tensors of Riemannian manifolds that admit Lipschitz approximation by polyhedral metrics with curvature bounded below or above. We show that this condition is also sufficient for the existence of local…
Associated to any supermanifold is a filtration by spaces, referred to as thickenings. It is the objective of this article to study them up to a certain equivalence and then up to isomorphism in the complex-analytic setting. We study them…
A notion of general manifolds is introduced. It covers all usual manifolds in mathematics. Essentially, it is a way how to get a bigger 'fibration' over a site which locally coincides with a given one. An enrichment with generalized…
We propose a Monte Carlo method to efficiently find, count, and sample abstract triangulations of a given manifold M. The method is based on a biased random walk through all possible triangulations of M (in the Pachner graph), constructed…
In this paper, we further explore the local-to-global approach for expansion of simplicial complexes that we call local spectral expansion. Specifically, we prove that local expansion in the links imply the global expansion phenomena of…
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
The main issues of the original Symmetrical smoothing method consists of approximation of the extremal volume of the set by the smooth symmetric function (sum of step functions) and then solve the optimization problem. when making…
Recent literature has shown that symbolic data, such as text and graphs, is often better represented by points on a curved manifold, rather than in Euclidean space. However, geometrical operations on manifolds are generally more complicated…
We review an approach which aims at studying discrete (pseudo-)manifolds in dimension $d\geq 2$ and called random tensor models. More specifically, we insist on generalizing the two-dimensional notion of $p$-angulations to higher…
This paper proposes a new method which builds a simplex based approximation of a $d-1$-dimensional manifold $M$ separating a $d$-dimensional compact set into two parts, and an efficient algorithm classifying points according to this…
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…
We propose a novel study of the stochastic proximal gradient method for minimizing the sum of two convex functions, one of which is smooth. Under suitable assumptions and without requiring any boundedness or control of the variance of the…
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…
Many remarkably robust, rapid and spontaneous self-assembly phenomena in nature can be modeled geometrically starting from a collection of rigid bunches of spheres. This paper highlights the role of symmetry in sphere-based assembly…
Simplicial approximation provides a framework for constructing simplicial complexes that are homotopy equivalent to a given manifold, provided a CW structure is explicitly known. However, its conventional implementation quickly becomes…
Except for crystalline or random structures, an agreed definition of complexity for intermediate and hence interesting cases does not exist. We fill this gap with a notion of complexity that characterises shapes formed by any finite number…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…