Related papers: Extremality criteria for the supereigenvector spac…
We present an algorithm for finding a basis of the supereigenvector space in max-plus algebra. The main ideas of the new algorithm are: finding better generators by exploiting the main operation of the tropical double description method and…
We give a combinatorial description of extremal generators of the supereigenvector cone {x: Ax>=x} in max algebra.
We provide a necessary and sufficient condition for matrices in the max-plus algebra to be pseudo-diagonalizable, calculate the powers of pseudo-diagonal matrices and prove the invariance of optimal-node matrices and separable matrices…
We find necessary and sufficient conditions on an (inverse) semigroup $X$ under which its semigroups of maximal linked systems $\lambda(X)$, filters $\phi(X)$, linked upfamilies $N_2(X)$, and upfamilies $\upsilon(X)$ are inverse.
We shall study non-linear extremal problems in Bergman space $\mathcal{A}^2(\mathbb{D})$. We show the existence of the solution and that the extremal functions are bounded. Further, we shall discuss special cases for polynomials,…
Consider an ergodic measure preserving dynamical system $(T,X,\mu)$, and an observable $\phi:X\to\mathbb{R}$. For the time series $X_n(x)=\phi(T^{n}(x))$, we establish limit laws for the maximum process $M_n=\max_{k\leq n}X_k$ in the case…
In order to guarantee the downloading quality requirements of users and improve the stability of data transmission in a BitTorrent-like peer-to-peer file sharing system, this article deals with eigenproblems of addition-min algebras. First,…
The elaboration of new quantization methods has recently developed the interest in the study of subalgebras of the Lie algebra of polynomial vector fields over a Euclidean space. In this framework, these subalgebras define maximal…
We give a necessary and sufficient condition for extremality of a supermodular function based on its min-representation by means of (vertices of) the corresponding core polytope. The condition leads to solving a certain simple linear…
In this article we introduce a new method, which we call a mutation-sunflower method, for calculating max-eigenvectors of a nonnegative irreducible $n\times n$ matrix $A$. Our method works in the general irreducible case, but it is in…
The max-plus algebra $\mathbb{R}\cup \{-\infty \}$ is a semiring with the two operations: addition $a \oplus b := \max(a,b)$ and multiplication $a \otimes b := a + b$. Roots of the characteristic polynomial of a max-plus matrix are called…
It is known that the solvability of a Sylvester equation over max-plus algebra can be determined in polynomial time by verifying its principal solution. A succinct representation of the principal solution is presented, with a more accurate…
A matrix $A$ is said to have $X$-simple image eigenspace if any eigenvector $x$ belonging to the interval $X=\{x\colon \underline{x}\leq x\leq\overline{x}\}$ is the unique solution of the system $A\otimes y=x$ in $X$. The main result of…
Let us consider the autonomous obstacle problem \begin{equation*} \min_v \int_\Omega F(Dv(x)) \, dx \end{equation*} on a specific class of admissible functions, where we suppose the Lagrangian satisfies proper hypotheses of convexity and…
We obtain Euler-Lagrange and transversality optimality conditions for higher-order infinite horizon variational problems on a time scale. The new necessary optimality conditions improve the classical results both in the continuous and…
In this paper we introduce new notions of local extremality for finite and infinite systems of closed sets and establish the corresponding extremal principles for them called here rated extremal principles. These developments are in the…
The existence of an extremal in an exponential Sobolev type inequality, with optimal constant, in Gauss space is established. A key step in the proof is an augmented version of the relevant inequality, which, by contrast, fails for a…
A geometric method is described to characterize the different kinds of extremals in optimal control theory. This comes from the use of a presymplectic constraint algorithm starting from the necessary conditions given by Pontryagin's Maximum…
We provide conjectural necessary and (separately) sufficient conditions for the Hilbert scheme of points of a given length to have the maximum dimension tangent space at a point. The sufficient condition is claimed for 3D and reduces the…
Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several classical results.