相关论文: On the Finiteness Property for Rational Matrices
The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b,…
Finding separable certificates of stability is important for tractability of analysis methods for large-scale networked systems. In this paper we consider the question of when a nonlinear system which is contracting, i.e. all solutions are…
We address nonautonomous initial boundary value problems for decoupled linear first-order one-dimensional hyperbolic systems, investigating the phenomenon of finite time stabilization. We establish sufficient and necessary conditions…
For a nonsingular integer matrix A, we study the growth of the order of A modulo N. We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or…
We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…
We give sufficient conditions which ensure that a functor of finite length from an additive category to finite-dimensional vector spaces has a projective resolution whose terms are finitely generated. For polynomial functors, we study also…
The set of finite binary matrices of a given size is known to carry a finite type A bicrystal structure. We first review this classical construction, explain how it yields a short proof of the equality between Kostka polynomials and…
We say that a metric space $(X,d)$ possesses the \emph{Banach Fixed Point Property (BFPP)} if every contraction $f:X\to X$ has a fixed point. The Banach Fixed Point Theorem says that every complete metric space has the BFPP. However, E.…
The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…
We characterize the idempotent stable range one $2\times 2$ matrices over commutative rings and in particular, the integral matrices with this property. Several special cases and examples complete the subject.
Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A particular kind of rational relations is the sequential functions. Sequential functions are the functions that…
We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…
This paper explores the finiteness of the solution set of the polynomial complementarity problem (PCP). To achieve this goal, we introduce two new classes of structured tensor tuples, namely the nondegenerate tensor tuple and the strong…
Broadly speaking, a finiteness property of groups is any generalisation of the property of having finite order. A large part of infinite group theory is concerned with finiteness properties and the relationships between them. Profinite…
We present a convergence result for infinite products of stochastic matrices with positive diagonals. We regard infinity of the product to the left. Such a product converges partly to a fixed matrix if the minimal positive entry of each…
We present an standard constraints generation algorithm to find an explicit set whose robustness is equal to the robustness of the feasible solution set of a combinatorial optimization problem with cost uncertainty. Computational experience…
We study the relationship between the positivity property in a rank 2 cluster algebra, and the property of such an algebra to be tame. More precisely, we show that a rank 2 cluster algebra has a basis of indecomposable positive elements if…
We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…
We consider the preservation of properties of being finitely generated, being finitely presented and being residually finite under direct products in the context of different types of algebraic structures. The structures considered include…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…