Related papers: Sparse stable configurations of hard discs in a bo…
A stable filter has the property that it asymptotically `forgets' initial perturbations. As a result of this property, it is possible to construct approximations of such filters whose errors remain small in time, in other words…
The Minimal Model Program offers natural higher-dimensional analogues of stable $n$-pointed curves and maps: stable pairs consisting of a projective variety $X$ of dimension $\ge2$ and a divisor $B$, that should satisfy a few simple…
In the context of state-space models, skeleton-based smoothing algorithms rely on a backward sampling step which by default has a $\mathcal O(N^2)$ complexity (where $N$ is the number of particles). Existing improvements in the literature…
We construct a marginally stable linear switching system in continuous time, in four dimensions and with three switching states, which is exponentially stable with respect to constant switching laws and which has a unique Barabanov norm,…
Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line…
We propose an alternative approach to count the microscopic static configurations of granular packs under gravity by considering arches. This strategy simplifies the problem of filtering out configurations that are not mechanically stable,…
We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
In our recent work on iterative computation in hardware, we showed that arbitrary-precision solvers can perform more favorably than their traditional arithmetic equivalents when the latter's precisions are either under- or over-budgeted for…
A construction is given of Markov partitions for some rational maps, which persist over regions of parameter space, not confined to single hyperbolic components. The set on which the Markov partition exists, and its boundary, are analysed.
The present contribution proves the asymptotic orbital stability of viscous regularizations of stable Riemann shocks of scalar balance laws, uniformly with respect to the viscosity/diffusion parameter $\epsilon$. The uniformity is…
The stability of the recently discovered compacton solutions is studied by means of both linear stability analysis as well as Lyapunov stability criteria. From the results obtained it follows that, unlike solitons, all the allowed compacton…
The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits.…
Rigid particles pack into structures, such as sand dunes on the beach, whose overall stability is determined by the average number of contacts between particles. However, when packing spatially extended objects with flexible shapes,…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
In a round ball $B\subset\mathbb{R}^{n+1}$ endowed with an $O(n+1)$-invariant metric we consider a radial function that weights volume and area. We prove that a compact two-sided hypersurface in $B$ which is stable capillary in weighted…
Sparse representations using learned dictionaries are being increasingly used with success in several data processing and machine learning applications. The availability of abundant training data necessitates the development of efficient,…
We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given…
The intersection graph induced by a set $\Disks$ of $n$ disks can be dense. It is thus natural to try and sparsify it, while preserving connectivity. Unfortunately, sparse graphs can always be made disconnected by removing a small number of…
We show that every invertible strong mixing transformation on a Lebesgue space has strictly over-recurrent sets. Also, we give an explicit procedure for constructing strong mixing transformations with no under-recurrent sets. This answers…