Related papers: A Simple Condition for Bounded Displacement
The singular subspaces perturbation theory is of fundamental importance in probability and statistics. It has various applications across different fields. We consider two arbitrary matrices where one is a leave-one-column-out submatrix of…
We consider primitive substitution tilings on R^d whose expansion maps are unimodular. We assume that all the eigenvalues of the expansion maps are algebraic conjugates with the same multiplicity. In this case, we can construct a…
We consider a single-cell network of random transmitters and fixed relays in a bounded domain of Euclidean space. The transmitters arrive over time and select one relay according to a spatially inhomogeneous preference kernel. Once a…
We review the relations between distance matrices and isometric embeddings and give simple proofs that distance matrices defined on euclidean and spherical spaces have all eigenvalues except one non-negative. Several generalizations are…
We consider localised states in a discrete bistable Allen-Cahn equation. This model equation combines bistability and local cell-to-cell coupling in the simplest possible way. The existence of stable localised states is made possible by…
The exactly solvable four-vertex model on a square grid with the different boundary conditions is considered. The application of the Algebraic Bethe Ansatz method allows to calculate the partition function of the model. For the fixed…
We study interpolating sequences of $d$-tuples of matrices, by looking at the commuting and the non-commuting case separately. In both cases, we will give a characterization of such sequences in terms of separation conditions on suitable…
We characterize the polytopes in $\mathbb{R}^d$ (not necessarily convex or connected ones) which multi-tile the space by translations along a given lattice. We also give a necessary and sufficient condition for two polytopes in…
The eigenproblem of low-rank updated matrices are of crucial importance in many applications. Recently, an upper bound on the number of distinct eigenvalues of a perturbed matrix was established. The result can be applied to estimate the…
This paper presents methods to compare networks where relationships between pairs of nodes in a given network are defined. We define such network distance by searching for the optimal method to embed one network into another network, prove…
Network Embeddings (NEs) map the nodes of a given network into $d$-dimensional Euclidean space $\mathbb{R}^d$. Ideally, this mapping is such that `similar' nodes are mapped onto nearby points, such that the NE can be used for purposes such…
There is not a unique solution to the electro- or magnetostatic problem where the "boundary condition" is merely a specification of the fields along a line. As a practical example, we consider the case where it is desired to have a magnetic…
We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order and modal languages without labels on transitions or atomic propositions on…
We study a coupled system of two parabolic equations in one space dimension. This system is singular because of the presence of one term with the inverse of the gradient of the solution. Our system describes an approximate model of the…
In this study, we propose an alternative way to simulate particle suspensions using the lattice Boltzmann method. The main idea is to impose the non-slip boundary condition in the lattice sites located on the particle boundaries. The focus…
For a fixed symmetric matrix A and symmetric perturbation E we develop purely deterministic bounds on how invariant subspaces of A and A+E can differ when measured by a suitable "row-wise" metric rather than via traditional measures of…
I show that a single embedded non-Hermitian defect in a one-dimensional topological system at certain degrees of non-Hermiticity can remove the topological mode from the edge and restore it inside the lattice at the same place where the…
We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the…
Oscillatory dynamics are ubiquitous in biological networks. Possible sources of oscillations are well understood in low-dimensional systems, but have not been fully explored in high-dimensional networks. Here we study large networks…
The discriminantal arrangement is the space of configurations of $n$ hyperplanes in generic position in a $k$ dimensional space (see \cite{MS}). Differently from the case $k=1$ in which it corresponds to the well known braid arrangement,…