Related papers: Generic consistency and nondegeneracy of verticall…
In [R. Andreani, G. Haeser, L. M. Mito, H. Ram\'irez C., Weak notions of nondegeneracy in nonlinear semidefinite programming, arXiv:2012.14810, 2020] the classical notion of nondegeneracy (or transversality) and Robinson's constraint…
In this paper we are concerned with the stability of equilibrium solutions of periodic Hamiltonian systems with one degree of freedom in the case of degeneracy, which means that the characteristic exponents of the linearized system have…
For the universal isomonodromic deformation of an irreducible logarithmic rank two connection over a smooth complex projective curve of genus at least two, consider the family of holomorphic vector bundles over curves underlying this…
In this paper we begin the classification of coherent systems $(E,V)$ on the projective line which are stable with respect to some value of a parameter $\alpha$. In particular we show that the moduli spaces, if non-empty, are always smooth…
Symmetry groups allow to transform solutions of differential equations continuously into other solutions. This property can be used for the observability analysis of infinite-dimensional systems with input and output. In this contribution,…
Since the strong degeneracies present in the N-body problem, even in the basic case of the planar three-body problem, nobody inspects the problem of nonlinear stability of Lagrange relative equilibrium. We introduce a new coordinate system…
We show that with high probability, random rank 1 matrices over a finite field are in (linearly) general position, at least provided their shape k x l is not excessively unbalanced. This translates into saying that the dimension of the…
We develop a general stability analysis for objective structures, which constitute a far reaching generalization of crystal lattice systems. We show that these particle systems, although in general neither periodic nor space filling, allow…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
It is well-understood that the robustness of mechanical and robotic control systems depends critically on minimizing sensitivity to arbitrary application-specific details whenever possible. For example, if a system is defined and performs…
Two new concepts, generic regular decomposition and regular-decomposition-unstable (RDU) variety for generic zero-dimensional systems, are introduced in this paper and an algorithm is proposed for computing a generic regular decomposition…
Variationality of the equation of conformal geodesics is an important problem in geometry with applications to general relativity. Recently it was proven that, in three dimensions, this system of equations for un-parametrized curves is the…
We consider the three-dimensional relativistic Vlasov-Maxwell-Boltzmann system, where the speed of light $c$ is an arbitrary constant no less than 1, and we establish global existence and nonlinear stability of the vacuum for small initial…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
We consider uniformly strongly elliptic systems of the second order with bounded coefficients. First, sufficient conditions for the invariance of convex bodies obtained for linear systems without zero order term in bounded domains and…
This paper investigates the interplay between local and global equivalences on noncommutative polynomials, the elements of the free algebra. When the latter are viewed as functions in several matrix variables, a local equivalence of…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We describe a framework for random pairwise comparisons matrices, inspired by selected constructions releted to the so called inconsistency reduction of pairwise comparisons (PC) matrices. In to build up structures on random pairwise…
One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain…
This paper deals with random dynamical systems of polynomial automorphisms (complex generalized H\'{e}non maps and their conjugate maps) of $\Bbb{C}^{2}.$ We show that a generic random dynamical system of polynomial automorphisms has ``mean…