Related papers: On the Congruences in Right Loops
A characterization of congruences in free semigroups is presented.
A matching queue is described via a graph $G$ together with a matching policy. Specifically, to each node in the graph there is a corresponding arrival process of items which can either be queued, or matched with queued items in neighboring…
In this paper we prove that in the context of varieties with Right Existentially Definable Factor Congruences, definability of the property "e and f are complementary central elements", stability by complements and coextensivity of its…
We prove that if two knots are concordant, their involutive knot Floer complexes satisfy a certain type of stable equivalence.
We prove that a necessary condition for the existence of the remaining problem in the harmonic Hopf construction is also sufficient. We also give some topological applications based on our result.
This technical report replies to the comments of [2] in detail, and corrects a possible mis-interpretation of [1] in terms of the conventional robust stability concept. After defining the robust stability and quadratic stability concepts,…
For a product of i.i.d. random maps or a memoryless stochastic flow on a compact space $X$, we find conditions under which the presence of locally asymptotically stable trajectories (e.g. as given by negative Lyapunov exponents) implies…
A detailed analysis of necessary conditions on a family of many-body potentials, which ensure stability, superstability or strong superstability of a statistical system is given in present work.There has been given also an example of…
Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large…
We prove Gray--Moser stability theorems for complementary pairs of forms of constant class defining symplectic pairs, contact-symplectic pairs and contact pairs. We also consider the case of contact-symplectic and contact-contact…
We consider the stability of synchronized states (including equilibrium point, periodic orbit or chaotic attractor) in arbitrarily coupled dynamical systems (maps or ordinary differential equations). We develop a general approach, based on…
Concentration-compactness is used to prove compactness of maximising sequences for a variational problem governing symmetric steady vortex-pairs in a uniform planar ideal fluid flow, where the kinetic energy is to be maximised and the…
We prove that the existence of a term $s$ satisfying $s(r,a,r,e) = s(a,r,e,a)$ in a general algebraic structure is equivalent to an existence of a term $t$ satisfying $t(x,x,y,y,z,z)=t(y,z,z,x,x,y)$. As a consequence of a general version of…
We give a reciprocity formula for a two-variable sum where the variables satisfy a linear congruence condition. We also prove that such sum is a measure of how well a rational is approximable from below and show that the reciprocity formula…
We prove that every lattice with more than one element has a proper congruence-preserving extension.
It is shown that a positive linear system on a time scale with a bounded graininess is uniformly exponentially stable if and only if the characteristic polynomial of the matrix defining the system has all its coefficients positive. Then…
We consider the problem of closeness of solutions of an exact and an averaged difference equations on an infinite interval. Appropriate assertions are derived from one special theorem on the stability under constantly acting perturbations.
We consider graphical solutions to mean curvature flow and obtain a stability result for homothetically expanding solutions coming out of cones of positive mean curvature: If another solution is initially close to the cone at infinity, then…
The homology groups of many natural sequences of groups $\{G_n\}_{n=1}^{\infty}$ (e.g. general linear groups, mapping class groups, etc.) stabilize as $n \rightarrow \infty$. Indeed, there is a well-known machine for proving such results…
Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such…