On upper semicontinuity of the Allen–Cahn twisted eigenvalues

We give an asymptotic upper bound for the kth twisted eigenvalue of the linearized Allen–Cahn operator in terms of the kth eigenvalue of the Jacobi operator, taken with respect to the minimal surface arising as the asymptotic limit of the zero sets of the Allen–Cahn critical points. We use an argument based on the notion of second inner variation developed in Le (On the second inner variations of Allen–Cahn type energies and applications to local minimizers. J. Math. Pures Appl. (9) 103 (2015) 1317–1345).

Reasoning Method between Polynomial Error Assertions

Error coefficients are ubiquitous in systems. In particular, errors in reasoning verification must be considered regarding safety-critical systems. We present a reasoning method that can be applied to systems described by the polynomial error assertion (PEA). The implication relationship between PEAs can be converted to an inclusion relationship between zero sets of PEAs; the PEAs are then transformed into first-order polynomial logic. Combined with the quantifier elimination method, based on cylindrical algebraic decomposition, the judgment of the inclusion relationship between zero sets of PEAs is transformed into judgment error parameters and specific error coefficient constraints, which can be obtained by the quantifier elimination method. The proposed reasoning method is validated by proving the related theorems. An example of intercepting target objects is provided, and the correctness of our method is tested through large-scale random cases. Compared with reasoning methods without error semantics, our reasoning method has the advantage of being able to deal with error parameters.

Low-Degree Approximation of Random Polynomials

We prove that with “high probability” a random Kostlan polynomial in $$n+1$$ n + 1 many variables and of degree d can be approximated by a polynomial of “low degree” without changing the topology of its zero set on the sphere $$\mathbb {S}^n$$ S n . The dependence between the “low degree” of the approximation and the “high probability” is quantitative: for example, with overwhelming probability, the zero set of a Kostlan polynomial of degree d is isotopic to the zero set of a polynomial of degree $$O(\sqrt{d \log d})$$ O ( d log d ) . The proof is based on a probabilistic study of the size of $$C^1$$ C 1 -stable neighborhoods of Kostlan polynomials. As a corollary, we prove that certain topological types (e.g., curves with deep nests of ovals or hypersurfaces with rich topology) have exponentially small probability of appearing as zero sets of random Kostlan polynomials.

Perfect hypercomplex algebras: Semi-tensor product approach

<abstract><p>The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebras (PHAs) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product (STP) of matrices are reviewed. The zero sets are defined for non-invertible hypercomplex numbers in a given PHA, and characteristic functions are proposed for calculating zero sets. Then PHA of various dimensions are considered. First, classification of $ 2 $-dimensional PHAs are investigated. Second, all the $ 3 $-dimensional PHAs are obtained and the corresponding zero sets are calculated. Finally, $ 4 $- and higher dimensional PHAs are also considered.</p></abstract>