Related papers: An Elementary Integrality Proof of Rothblum's Stab…
A graph with convex quadratic stability number is a graph for which the stability number is determined by solving a convex quadratic program. Since the very beginning, where a convex quadratic programming upper bound on the stability number…
We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…
The independence polynomial of a graph is termed {\it stable} if all its roots are located in the left half-plane $\{z \in \mathbb{C} : \mathrm{Re}(z) \leq 0\}$, and the graph itself is also referred to as stable. Brown and Cameron…
The paper considers the convergence to equilibrium for measure solutions of the spatially homogeneous Boltzmann equation for hard potentials with angular cutoff. We prove the exponential sharp rate of strong convergence to equilibrium for…
This is a short survey about the theory of stable polynomials and its applications. It gives self-contained proofs of two theorems of Schrijver. One of them asserts that for a $d$--regular bipartite graph $G$ on $2n$ vertices, the number of…
It is well known that a fixed point iteration for solving a linear equation system converges if and only if the spectral radius of the iteration matrix is less than one. A method is presented which guarantees the Fixed Point, even if this…
For perturbations of integrable Hamiltonians systems, the Nekhoroshev theorem shows that all solutions are stable for an exponentially long interval of time, provided the integrable part satisfies a steepness condition and the system is…
The question of complete integrability of evolution equations associated to $n\times n$ first order isospectral operators is investigated using the inverse scattering method. It is shown that for $n>2$, e.g. for the three-wave interaction,…
The paper deals with the stability of the fundamental equation of information of multiplicative type. It will be proved that the equation in question is stable in the sense of Hyers and Ulam under some assumptions. This result will be…
We explore the integration of representations from a Lie algebra to its algebraic group in positive characteristic. An integrable module is stable under the twists by group elements. Our aim is to investigate cohomological obstructions for…
We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…
In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…
There are three types of results in this paper. The first, extending a representation theorem on a conformal mapping that omits two values of equal modulus. This was due to Brickman and Wilken. They constructed a representation as a convex…
In this study, the problem of robust Schur stability of $n\times n$ dimensional matrix segments by using the bialternate product of matrices is considered. It is shown that the problem can be reduced to the existence of negative eigenvalues…
The purpose of this paper is to summarize the recent results on the stability of the parametric fundamental equation of information. Furthermore, by the help of a modification of a method we used in \cite{GM08} we shall give a unified proof…
We establish the optimal regularity for the distortion of inverses of mappings of finite distortion with logarithm-iterated style subexponentially integrable distortion, which generalizes the Theorem 1. of [J. Gill, Ann. Acad. Sci. Fenn.…
We prove that a (branched) minimal immersion from $\mathbb{C}$ to $\mathbb{R}^n$ is stable if and only if it lives in an even dimensional affine subspace and is holomorphic for some orthogonal complex structure on the subspace. More…
This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…
In the last decade, copositive formulations have been proposed for a variety of combinatorial optimization problems, for example the stability number (independence number). In this paper, we generalize this approach to infinite graphs and…
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63--72]. As a…