Related papers: Termination of Triangular Polynomial Loops

We present a simple proof that finding a rank-$R$ canonical polyadic decomposition of a 3-dimensional tensor over a finite field $\mathbb{F}$ is fixed-parameter tractable with respect to $R$ and $\mathbb{F}$. We also show a nontrivial upper…

Higher-order rewriting is a framework in which one can write higher-order programs and study their properties. One such property is termination: the situation that for all inputs, the program eventually halts its execution and produces an…

Looking at the well understood case of log terminal surface singularities, one observes that each of them is the quotient of a factorial one by a finite solvable group. The derived series of this group reflects an iteration of Cox rings of…

We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomials with suitably generic p-adic Newton polygon. We thus…

In this paper, a transform approach is used for polycyclic and serial codes over finite local rings in the case that the defining polynomials have no multiple roots. This allows us to study them in terms of linear algebra and invariant…

We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…

The purposes of this paper are to classify lower triangular forms and to determine under what conditions a nonlinear system is equivalent to a specific type of lower triangular forms. According to the least multi-indices and the greatest…

Results on the problem of stabilizing a nonlinear continuous-time system by a finite number of control or measurement values are presented. The basic tool is a discontinuous version of the so-called semi-global backstepping lemma. We derive…

The existence of a finite basis of algebraically independent one-loop integrals has underpinned important developments in the computation of one-loop amplitudes in field theories and gauge theories in particular. We give an explicit…

Let End(V) denote the ring of all linear transformations of an arbitrary k-vector space V over a field k. We define a subset X of End(V) to be "triangularizable" if V has a well-ordered basis such that X sends each vector in that basis to…

The termination problem for affine programs over the integers was left open in\cite{Braverman}. For more that a decade, it has been considered and cited as a challenging open problem. To the best of our knowledge, we present here the most…

We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving termination of higher-order foundational calculi. To establish the method, we use a…

We elaborate upon and consolidate various recent developments focusing on the triality of questions offered by issues of basis building, unitarity and non-polylogarithmicity in quantum field theory, specifically for planar two loops. The…

We significantly strengthen results on the structure of matrix rings over finite fields and apply them to describe the structure of the so-called weakly $n$-torsion clean rings. Specifically, we establish that, for any field $F$ with either…

We generalize the study of standard Lyndon loop words from [A.Negut, A.Tsymbaliuk, "Quantum loop groups and shuffle algebras via Lyndon words", Adv. Math. 439 (2024), Paper No. 109482] to a more general class of orders on the underlying…

The chase is a widely implemented approach to reason with tuple-generating dependencies (tgds), used in data exchange, data integration, and ontology-based query answering. However, it is merely a semi-decision procedure, which may fail to…

We present an approach to evaluate the full operatorial Q-system of all $\mathfrak{u}(p,q|r+s)$-invariant spin chains with representations of Jordan-Schwinger type. In particular, this includes the super spin chain of planar $\mathcal{N}=4$…

We propose a novel factorization of a non-singular matrix $P$, viewed as a $2\times 2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower…