English
Related papers

Related papers: Quantifier Elimination for Normal Cone Computation…

200 papers

Our main purpose is to give multiple examples for using the available implementations for computing the normalization of an affine ring, computing the minimial generators of the normalization as an algebra over the original ring and…

Commutative Algebra · Mathematics 2007-05-23 Amelia Taylor

A covariant quantization scheme employing reducible representations of canonical commutation relations with positive-definite metric and Hermitian four-potentials is tested on the example of quantum electrodynamic fields produced by a…

High Energy Physics - Theory · Physics 2014-11-18 Marek Czachor , Jan Naudts

We generalize the framework of virtual substitution for real quantifier elimination to arbitrary but bounded degrees. We make explicit the representation of test points in elimination sets using roots of parametric univariate polynomials…

Symbolic Computation · Computer Science 2015-01-26 Marek Kosta , Thomas Sturm

We present verification protocols to gain confidence in the correct performance of the realization of an arbitrary universal quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are…

Quantum Physics · Physics 2025-08-11 Jose Carrasco , Marc Langer , Antoine Neven , Barbara Kraus

We derive a set of easy rules to follow when estimating the coefficients of operators in an effective Lagrangian. In particular, we emphasize how to estimate the size of coefficients originating from irrelevant interactions in the…

High Energy Physics - Phenomenology · Physics 2011-05-17 Matti Antola , Kimmo Tuominen

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

Logic in Computer Science · Computer Science 2007-12-11 Klaus Aehlig , Arnold Beckmann

We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…

Data Structures and Algorithms · Computer Science 2023-06-22 Thorsten Wißmann , Ulrich Dorsch , Stefan Milius , Lutz Schröder

Quantifier elimination (QE) and Craig interpolation (CI) are central to various state-of-the-art automated approaches to hardware and software verification. They are rooted in the Boolean setting and are successful for, e.g., first-order…

Logic in Computer Science · Computer Science 2026-01-13 Kevin Batz , Joost-Pieter Katoen , Nora Orhan

Two approaches to nonperturbative renormalization are discussed for theories quantized on the light cone. One is tailored specifically to a calculation of the dressed-electron state in quantum electrodynamics, where an invariant-mass cutoff…

High Energy Physics - Phenomenology · Physics 2007-05-23 J. R. Hiller

Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…

Optimization and Control · Mathematics 2025-02-18 Adam Brown , Kanstantsin Pashkovich , Levent Tunçel

In this paper we introduce a novel quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to…

Symbolic Computation · Computer Science 2023-10-03 Jasper Nalbach , Valentin Promies , Erika Ábrahám , Paul Kobialka

Many natural counting problems arise in connection with the normal form of braids--and seem to have never been considered so far. Here we solve some of them by analysing the normality condition in terms of the associated permutations, their…

Combinatorics · Mathematics 2007-05-23 Patrick Dehornoy

High-efficient direct numerical methods are currently in demand for optimization procedures in the fields of both conventional diffractive and metasurface optics. With a view of extending the scope of application of the previously proposed…

Computational Physics · Physics 2019-09-04 Alexey A. Shcherbakov

Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit…

Logic in Computer Science · Computer Science 2018-10-18 Gabriel Ebner

We introduce a canonical form for reduced bases of integral closures of discrete valuation rings, and we describe an algorithm for computing a basis in reduced normal form. This normal form has the same applications as the Hermite normal…

Number Theory · Mathematics 2016-04-25 Nathália Moraes de Oliveira , Enric Nart

For the general parametric regression models with covariates contaminated with normal measurement errors, this paper proposes an accelerated version of the classical simulation extrapolation algorithm to estimate the unknown parameters in…

Methodology · Statistics 2021-07-13 Kanwal Ayub , Weixing Song

We extend our recently-proposed formalism for calculating anomalies of global and gauge symmetries using the Covariant Derivative Expansion to include a general class of operators that can appear in relativistic Effective Field Theories…

High Energy Physics - Phenomenology · Physics 2023-01-04 Timothy Cohen , Xiaochuan Lu , Zhengkang Zhang

We give a short review of the algebraic procedure known as deformation quantisation, which replaces a commutative algebra with a non-commutative algebra. We use this framework to examine how the objects known as wavefunctions, as known in…

Mathematical Physics · Physics 2022-08-17 Michael Swaddle

For any $k \in \Nat$, we show that the cone of $(k+1)$-secant lines of a closed subscheme $Z \subset \mathbb{P}^n_K$ over an algebraically closed field $K$ running through a closed point $p \in \mathbb{P}^n_K$ is defined by the $k$-th…

Commutative Algebra · Mathematics 2010-11-19 Simon Kurmann

Working in a semi-constructive logical system that supports the extraction of concurrent programs, we extract a program inverting non-singular real valued matrices from a constructive proof based on Gaussian elimination. Concurrency is used…

Logic in Computer Science · Computer Science 2023-05-18 Ulrich Berger , Monika Seisenberger , Dieter Spreen , Hideki Tsuiki