Search Results - "Computer Science - Symbolic Computation"

FMplex: Exploring a Bridge between Fourier-Motzkin and Simplex by Promies, Valentin, Nalbach, Jasper, Ábrahám, Erika, Kobialka, Paul

“…In this paper we present a quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin…”
Get full text

Linear equations for unordered data vectors in $[D]^k\to{}Z^d by Hofman, Piotr, Różycki, Jakub

“…Following a recently considered generalisation of linear equations to unordered-data vectors and to ordered-data vectors, we perform a further generalisation…”
Get full text

Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness by Banerjee, Tamajit, Majumdar, Rupak, Mallik, Kaushik, Schmuck, Anne-Kathrin, Soudjani, Sadegh

“…We consider fixpoint algorithms for two-player games on graphs with $\omega$-regular winning conditions, where the environment is constrained by a strong…”
Get full text

Lazard-style CAD and Equational Constraints by Davenport, James H, Nair, Akshar S, Sankaran, Gregory K, Uncu, Ali K

“…McCallum-style Cylindrical Algebra Decomposition (CAD) is a major improvement on the original Collins version, and has had many subsequent advances, notably…”
Get full text

Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers by Hamana, Makoto

“…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…”
Get full text

Transcendence Certificates for D-finite Functions by Kauers, Manuel, Koutschan, Christoph, Verron, Thibaut

“…Although in theory we can decide whether a given D-finite function is transcendental, transcendence proofs remain a challenge in practice. Typically,…”
Get full text

Guessing with Little Data by Kauers, Manuel, Koutschan, Christoph

“…Reconstructing a hypothetical recurrence equation from the first terms of an infinite sequence is a classical and well-known technique in experimental…”
Get full text

Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one by Xavier Dahan

Get full text

FMplex: A Novel Method for Solving Linear Real Arithmetic Problems by Nalbach, Jasper, Promies, Valentin, Ábrahám, Erika, Kobialka, Paul

“…In this paper we introduce a novel quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the…”
Get full text

Invariants: Computation and Applications by Kogan, Irina A

“…Invariants withstand transformations and, therefore, represent the essence of objects or phenomena. In mathematics, transformations often constitute a group…”
Get full text

Hahn series and Mahler equations: Algorithmic aspects by Faverjon, C, Roques, Julien

“…Many articles have recently been devoted to Mahler equations, partly because of their links with other branches of mathematics such as automata theory. Hahn…”
Get full text

On Minimal and Minimum Cylindrical Algebraic Decompositions by Lucas, Michel, Mathonet, Pierre, Zénaïdi, Naïm

“…We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of \(\mathbb{R}^n\). In this framework, a CAD…”
Get full text

An algorithm to recognize regular singular Mahler systems by Faverjon, Colin, Poulet, Marina

“…This paper is devoted to the study of the analytic properties of Mahler systems at 0. We give an effective characterisation of Mahler systems that are regular…”
Get full text

Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting by Berthomieu, Jérémy, Mohr, Rafael

“…We describe a version of the FGLM algorithm that can be used to compute generic fibers of positive-dimensional polynomial ideals. It combines the FGLM…”
Get full text

Subresultants of Several Univariate Polynomials in Newton Basis by Wang, Weidong, Yang, Jing

“…In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the…”
Get full text

A SageMath Package for Elementary and Sign Vectors with Applications to Chemical Reaction Networks by Aichmayr, Marcus S, Müller, Stefan, Regensburger, Georg

“…We present our SageMath package elementary_vectors for computing elementary and sign vectors of real subspaces. In this setting, elementary vectors are…”
Get full text

On the computation of Gröbner bases for matrix-weighted homogeneous systems by Verron, Thibaut

“…In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of…”
Get full text

A Generic and Executable Formalization of Signature-Based Gröbner Basis Algorithms by Maletzky, Alexander

“…We present a generic and executable formalization of signature-based algorithms (such as Faugère's \(F_5\)) for computing Gr\"obner bases, as well as their…”
Get full text

Linear difference operators with sequence coefficients having infinite-dimentional solution spaces by Abramov, Sergei, Pogudin, Gleb

“…The notion of lacunary infinite numerical sequence is introduced. It is shown that for an arbitrary linear difference operator L with coefficients belonging to…”
Get full text

Parametric "Non-nested" Discriminants for Multiplicities of Univariate Polynomials by Hong, Hoon, Yang, Jing

“…We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible…”
Get full text