Related papers: Sparse stable configurations of hard discs in a bo…
A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…
A linear time-invariant dissipative Hamiltonian (DH) system x' = (J-R)Q x, with a skew-Hermitian J, an Hermitian positive semi-definite R, and an Hermitian positive definite Q, is always Lyapunov stable and under weak further conditions…
It is often assumed that a warped galaxy can be modeled by a set of rings. This paper verifies numerically the validity of this assumption by the study of periodic orbits populating a heavy self-gravitating warped disk. The phase space…
We consider an autonomous differential system in $\mathbb{R}^n$ with a periodic orbit and we give a new method for computing the characteristic multipliers associated to it. Our method works when the periodic orbit is given by the…
Design of microparticles which stabilize at the centerline of a channel flow when part of a dilute suspension is examined numerically for moderate Reynolds numbers ($10 \le Re \le 80$). Stability metrics for particles with arbitrary shapes…
In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability polynomial exhibits chaotic behaviour. We use this connection…
We explore a series expansion method to calculate the modes of oscillations for a variety of uniformly rotating finite disks, either with or without a dark halo. Since all models have the same potential, this survey focuses on the role of…
We consider $N$ circles of equal radii, $r$, having their centers randomly placed within a square domain $\mathcal{D}$ of size $L \times L$ with periodic boundary conditions ($\mathcal{D} \in \mathbb{R}^2$). When two or more circles…
We introduce sparse versions of function spaces that are relevant to characterize the solutions of Euler equations without concentration. The standard Sobolev space $H^{-1}$ is given a sparse structure that allows to measure the degree of…
It is common practice in Markov chain Monte Carlo to update the simulation one variable (or sub-block of variables) at a time, rather than conduct a single full-dimensional update. When it is possible to draw from each full-conditional…
In many problems in Computational Physics and Chemistry, one finds a special kind of sparse matrices, termed "banded matrices". These matrices, which are defined as having non-zero entries only within a given distance from the main…
In this paper we consider a one dimensional liner piecewise-smooth discontinuous map. It is well known that stable periodic orbits exist in this type of map for a specific parameter region. It is also known that the corresponding…
In this paper, we provide a novel solution to an open problem on the global uniform stability of switched nonlinear systems. Our results are based on the Koopman operator approach and, to our knowledge, this is the first theoretical…
State space subspace algorithms for input-output systems have been widely applied but also have a reasonably well-developedasymptotic theory dealing with consistency. However, guaranteeing the stability of the estimated system matrix is a…
We study the $k$-center problem in a kinetic setting: given a set of continuously moving points $P$ in the plane, determine a set of $k$ (moving) disks that cover $P$ at every time step, such that the disks are as small as possible at any…
In a recent paper, M. E. Kahoui and M. Ouali have proved that over an algebraically closed field $k$ of characteristic zero, residual coordinates in $k[X][Z_1,\dots,Z_n]$ are one-stable coordinates. In this paper we extend their result to…
We consider the demixing problem of two (or more) high-dimensional vectors from nonlinear observations when the number of such observations is far less than the ambient dimension of the underlying vectors. Specifically, we demonstrate an…
We consider the problem of interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Building on the algorithm of Ben-Or and Tiwari for interpolating polynomials over rings with characteristic zero,…
In this paper we present the event-chain algorithms, which are fast Markov-chain Monte Carlo methods for hard spheres and related systems. In a single move of these rejection-free methods, an arbitrarily long chain of particles is…
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…