English
Related papers

Related papers: Decision problem for a class of univariate Pfaffia…

200 papers

Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…

Logic in Computer Science · Computer Science 2023-06-08 Bernard Boigelot , Pascal Fontaine , Baptiste Vergain

The so-called polynomial equations play an important role both in algebra and in the theory of functional equations. If the unknown functions in the equation are additive, relatively many results are known. However, even in this case, there…

Commutative Algebra · Mathematics 2024-03-04 Eszter Gselmann , Mehak Iqbal

In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…

Symbolic Computation · Computer Science 2023-06-08 George Labahn , Cordian Riener , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

In this work we look at the original fractional calculus of variations problem in a somewhat different way. As a simple consequence, we show that a fractional generalization of a classical problem has a solution without any restrictions on…

Optimization and Control · Mathematics 2019-08-27 Rui A. C. Ferreira

The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of…

Logic in Computer Science · Computer Science 2025-01-29 Emmanuel Hainry , Bruce M. Kapron , Jean-Yves Marion , Romain Péchoux

We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…

Quantum Physics · Physics 2007-05-23 E. Knill , R. Laflamme

We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…

Number Theory · Mathematics 2023-02-06 Alessandro Languasco

A problem list in singularity theory. Most of these problems are related with the algorithmic enumeration of possible topological types of non-discriminant Morsifications of real function singularities, and/or with the Picard--Lefschetz…

Algebraic Geometry · Mathematics 2015-04-09 V. A. Vassiliev

In this paper, the authors propose the utilization of Fibonacci Neural Networks (FNN) for solving arbitrary order differential equations. The FNN architecture comprises input, middle, and output layers, with various degrees of Fibonacci…

Number Theory · Mathematics 2024-08-27 Kushal Dhar Dwivedi , Anup Singh

The bivariate difference filed $(\mathbb{F}(\alpha, \beta), \sigma)$ provides an algebraic framework for a sequence satisfying a recurrence of order two and it could transform the summation involving a sequence satisfying a recurrence of…

Combinatorics · Mathematics 2024-01-23 Yarong Wei

Let $\mathsf{F}_r$ be a free group of rank $r$, $\mathbb{F}_q$ a finite field of order q, and let $\mathrm{SL}_n(\mathbb{F}_q)$ act on $\mathrm{Hom}(\mathsf{F}_r, \mathrm{SL}_n(\mathbb{F}_q))$ by conjugation. We describe a general algorithm…

Algebraic Geometry · Mathematics 2014-07-02 Samuel Cavazos , Sean Lawton

We study quantum algorithms for the hidden shift problem of complex scalar- and vector-valued functions on finite abelian groups. Given oracle access to a shifted function and the Fourier transform of the unshifted function, the goal is to…

Quantum Physics · Physics 2025-07-28 Serge Adonsou , Peter Bruin , Maris Ozols , Joppe Stokvis

Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it…

Formal Languages and Automata Theory · Computer Science 2017-11-15 Markus Krötzsch , Tomáš Masopust , Michaël Thomazo

We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical conjectures such as Bouniakowsky's provide necessary…

Number Theory · Mathematics 2025-05-27 K. Lakshmanan

We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths and constants. This problem is known to be in EXPSPACE and…

Logic in Computer Science · Computer Science 2018-05-03 Martin Jonáš , Jan Strejček

In this study, a collocation method based on the Fibonacci operational matrix is proposed to solve generalized pantograph equations with linear functional arguments. Some illustrative examples are given to verify the efficiency and…

Numerical Analysis · Mathematics 2014-04-07 Ayse Betul Koc , Musa Cakmak , Aydin Kurnaz

This paper focuses on the problem of reconstructing a vector of rational functions given some evaluations, or more generally given their remainders modulo different polynomials. The special case of rational functions sharing the same…

Symbolic Computation · Computer Science 2020-02-21 Eleonora Guerrini , Romain Lebreton , Ilaria Zappatore

Some properties and relations satisfied by the polynomial solutions of a bispectral problem are studied. Given a finite order differential operator, under certain restrictions, its polynomial eigenfunctions are explicitly obtained, as well…

Functional Analysis · Mathematics 2023-09-20 L. M. Anguas , D. Barrios Rolanía

We consider a class of stochastic programs whose uncertain data has an exponential number of possible outcomes, where scenarios are affinely parametrized by the vertices of a tractable binary polytope. Under these conditions, we propose a…

Optimization and Control · Mathematics 2020-04-03 Gustavo Angulo

This paper presents a canonical dual method for solving a quadratic discrete value selection problem subjected to inequality constraints. The problem is first transformed into a problem with quadratic objective and 0-1 integer variables.…

Optimization and Control · Mathematics 2012-05-07 Ning Ruan , David Yang Gao