English
Related papers

Related papers: Bounding quantification in parametric expansions o…

200 papers

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

In the 1930s Tarski showed that real quantifier elimination was possible, and in 1975 Collins gave a remotely practicable method, albeit with doubly-exponential complexity, which was later shown to be inherent. We discuss some of the recent…

Symbolic Computation · Computer Science 2015-08-03 James H. Davenport , Matthew England

In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…

Rings and Algebras · Mathematics 2020-09-14 Samuel A. Lopes , Farrokh Razavinia

As already done for the matrix case for example in [Joe Harris, Algebraic Geometry - A first course, p.256] we give a parametrization of the Bouligand tangent cone of the variety of tensors of bounded TT rank. We discuss how the proof…

Optimization and Control · Mathematics 2017-05-30 Benjamin Kutschan

Type qualifiers offer a lightweight mechanism for enriching existing type systems to enforce additional, desirable, program invariants. They do so by offering a restricted but effective form of subtyping. While the theory of type qualifiers…

Programming Languages · Computer Science 2024-02-27 Edward Lee , Yaoyu Zhao , James You , Kavin Satheeskumar , Ondřej Lhoták , Jonathan Brachthäuser

Departing from a class of infinite series with central binomial coefficients in the numerator and depending on a positive integer parameter, we first extend known identities to all complex parameters. Then we use various methods, including…

Number Theory · Mathematics 2025-11-04 Karl Dilcher , Christophe Vignat

We study counting propositional logic as an extension of propositional logic with counting quantifiers. We prove that the complexity of the underlying decision problem perfectly matches the appropriate level of Wagner's counting hierarchy,…

Logic in Computer Science · Computer Science 2021-06-04 Melissa Antonelli , Ugo Dal Lago , Paolo Pistone

In the present paper, we consider Presburger arithmetic PrA and the theory of real closed fields RCF. Due to quantifier elimination in these theories, there are two kinds of natural ways to axiomatize them. Namely, on one hand, PrA can be…

Logic · Mathematics 2026-03-03 Fedor Pakhomov , Julien Daoud

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

Number Theory · Mathematics 2025-10-20 J. Maurice Rojas

We establish the formula for multiplication by the class of a special Schubert variety in the integral cohomology ring of the flag manifold. This formula also describes the multiplication of a Schubert polynomial by either an elementary…

alg-geom · Mathematics 2008-02-03 Frank Sottile

Assume given a polynomially bounded o-minimal structure expanding the real numbers. Let $(T_s)_{s\in \mathbb{R}}$ be a globally definable one parameter family of $C^2$-hypersurfaces of $\mathbb{R}^n$. Upon defining the notion of generalized…

Algebraic Geometry · Mathematics 2019-03-20 Nicolas Dutertre , Vincent Grandjean

The well-known Kummer's formula evaluates the hypergeometric series 2F1(A,B;C;-1) when the relation B-A+C=1 holds. This paper deals with evaluation of 2F1(-1) series in the case when C-A+B is an integer. Such a series is expressed as a sum…

Classical Analysis and ODEs · Mathematics 2007-05-23 Raimundas Vidunas

This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…

Geometric Topology · Mathematics 2018-09-28 J. Blackman

The Connes-Kreimer renormalization Hopf algebras are examples of a canonical quantization procedure for pre-Lie algebras. We give a simple construction of this quantization using the universal enveloping algebra for so-called twisted Lie…

Rings and Algebras · Mathematics 2010-03-25 Travis Schedler

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

Logic · Mathematics 2007-05-23 David Marker , Theodore A. Slaman

Let K be a field and denote by K[t], the polynomial ring with coefficients in K. Set A = K[f1,. .. , fs], with f1,. .. , fs $\in$ K[t]. We give a procedure to calculate the monoid of degrees of the K algebra M = F1A + $\times$ $\times$…

Algebraic Geometry · Mathematics 2017-03-13 A Abbas , A Assi , Pedro A Garcıa-Sánchez

Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be ``fixed'' by multiplying them by a suitable polynomial. We…

Symbolic Computation · Computer Science 2022-10-26 Robert Dougherty-Bliss

We introduce here a general framework for studying continued fraction expansions for complex numbers and establish some results on the convergence of the corresponding sequence of convergents. For continued fraction expansions with partial…

Number Theory · Mathematics 2015-09-16 S. G. Dani

We compute the Weierstrass semigroup at one totally ramified place for Kummer extensions defined by $y^m=f(x)^{\lambda}$ where $f(x)$ is a separable polynomial over $\mathbb{F}_q$. In addition, we compute the Weierstrass semigroup at two…

Algebraic Geometry · Mathematics 2020-01-29 Ariane M. Masuda , Luciane Quoos , Alonso Sepúlveda

We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…

General Mathematics · Mathematics 2024-11-26 Joseph M. Shunia
‹ Prev 1 8 9 10 Next ›