Related papers: Rigid components in fixed-lattice and cone framewo…
We show that coarse graining arguments invented for the analysis of multi-spin systems on a randomly triangulated surface apply also to the O(n) model on a random lattice. These arguments imply that if the model has a critical point with…
Sets of $d\times d$ matrices sharing a common invariant cone enjoy special properties, which are widely used in applications. However, finding this cone or even proving its existence/non-existence is hard. This problem is known to be…
We present efficient algorithms to calculate trajectories for periodic Lorentz gases consisting of square lattices of circular obstacles in two dimensions, and simple cubic lattices of spheres in three dimensions; these become increasingly…
He and Yuan's prediction-correction framework [SIAM J. Numer. Anal. 50: 700-709, 2012] is able to provide convergent algorithms for solving separable convex optimization problems at a rate of $O(1/t)$ ($t$ represents iteration times) in…
Neural Ordinary Differential Equations (ODEs) represent a significant advancement at the intersection of machine learning and dynamical systems, offering a continuous-time analog to discrete neural networks. Despite their promise, deploying…
Symmetry equations are obtained for the rigidity matrix of a bar-joint framework in R^d. These form the basis for a short proof of the Fowler-Guest symmetry group generalisation of the Calladine-Maxwell counting rules. Similar symmetry…
The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…
Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint…
Rigid, hard and soft problems and results in arithmetic geometry are presented. "Soft" and "hard" in our paper are limited to the framework of solutions of quadratic forms over rings of integers of local and global fields, the…
We show that universal rigidity of a generic bar and joint framework (G,p) in the line depends on more than the ordering of the vertices. In particular, we construct examples of one-dimensional generic frameworks with the same graph and…
Replicability requires that algorithmic conclusions remain consistent when rerun on independently drawn data. A central structural question is composition: given $k$ problems each admitting a $\rho$-replicable algorithm with sample…
We study the bar-and-joint frameworks in $\mathbb{R}^2$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by Streinu and Theran (2010). Katoh and Tanigawa (2013) remarked…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
The aim of this paper is to numerically investigate the orbital dynamics of the circular planar restricted problem of five bodies. By numerically integrating several large sets of initial conditions of orbits we classify them into three…
In this paper we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems and variational inequalities. This framework allows to obtain many…
In this paper, we present a deterministic algorithm to find a strong generic position for an algebraic space curve. We modify our existing algorithm for computing the topology of an algebraic space curve and analyze the bit complexity of…
In this paper we will look at the connection of frames and finite dimensionality. A main focus is to present simple algorithms and make them available online. The main result is a way to 'switch' between different frames, giving an…
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…
We consider the problem of characterising the generic rigidity of bar-joint frameworks in $\mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu…