Related papers: Bounding Distance Between Outputs in Distributed L…
We present a new algorithm for the design of the connection region between different lattice materials. We solve a Stokes-type topology optimization problem on a narrow morphing region to smoothly connect two different unit cells. The…
The collision avoidance constraints are prominent as non-convex, non-differentiable, and challenging when defined in optimization-based motion planning problems. To overcome these issues, this paper presents a novel non-conservative…
This work explores the edge agreement problem of second-order nonlinear multi-agent system under quantized measurements. Under the edge agreement framework, we introduce an important concept about the \emph{essential edge Laplacian} and…
We present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it…
Aiming at the study of critical phenomena in the presence of boundaries with a non-trivial shape we discuss how lattices with an adaptive lattice spacing can be implemented. Since the parameters of the Hamiltonian transform non-trivially…
The lattice Boltzmann method has become a standard technique for simulating a wide range of fluid flows. However, the intrinsic coupling of momentum and space discretization restricts the traditional lattice Boltzmann method to regular…
We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
We introduce a notion of distance between supervised learning problems, which we call the Risk distance. This distance, inspired by optimal transport, facilitates stability results; one can quantify how seriously issues like sampling bias,…
In multi-parameter persistence, the matching distance is defined as the supremum of weighted bottleneck distances on the barcodes given by the restriction of persistence modules to lines with a positive slope. In the case of finitely…
The large deviation properties of equilibrium (reversible) lattice gases are mathematically reasonably well understood. Much less is known in non--equilibrium, namely for non reversible systems. In this paper we consider a simple example of…
The paper investigates the Lattice Agreement (LA) problem in asynchronous systems. In LA each process proposes an element $e$ from a predetermined lattice, and has to decide on an element $e'$ of the lattice such that $e \leq e'$. Moreover,…
This paper investigates the problem of synthesizing joint distributions in the finite-length regime. For a fixed blocklength $n$ and an upper bound on the distribution approximation $\epsilon$, we prove a capacity result for fixed-length…
Approximate simulation, an extension of simulation relations from formal methods to continuous systems, is a powerful tool for hierarchical control of complex systems. Finding an approximate simulation relation between the full "concrete"…
In the pattern formation problem, robots in a system must self-coordinate to form a given pattern, regardless of translation, rotation, uniform-scaling, and/or reflection. In other words, a valid final configuration of the system is a…
A cornerstone of the theory of phase transitions is the observation that many-body systems exhibiting a spontaneous symmetry breaking in the thermodynamic limit generally show extensive fluctuations of an order parameter in large but finite…
The introduction of a lattice converts a singular boundary-layer problem in the continuum into a regular perturbation problem. However, the continuum limit of the discrete problem is extremely nontrivial and is not completely understood.…
We present a polynomial-time $\frac{3}{2}$-approximation algorithm for the problem of finding a maximum-cardinality stable matching in a many-to-many matching model with ties and laminar constraints on both sides. We formulate our problem…
In this article we revisit smoothing bounds in parallel between lattices $and$ codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian distributions and were crucial for arguing the security of many…
We introduce a new constructive method for establishing lower bounds on convergence rates of periodic homogenization problems associated with divergence type elliptic operators. The construction is applied in two settings. First, we show…