Related papers: Cosine and Computation

Boolean Satisfiability Problem (SAT) is one of the core problems in computer science. As one of the fundamental NP-complete problems, it can be used - by known reductions - to represent instances of variety of hard decision problems.…

This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…

The unique real root of cos(x) = x, recently referred to as the Dottie number, is expressed as an iteral of cosine. Using the derivatives of iterals, it is shown why this number is achieved starting from any real number, when the iterates…

A classical question of propositional logic is one of the shortest proof of a tautology. A related fundamental problem is to determine the relative efficiency of standard proof systems, where the relative complexity is measured using the…

Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study…

We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m<n, with nonsingular mxm submatrix B and b is an m-dimensional integer vector, finds a nonnegative integer solution to the system Ax=b…

We study a weighted divisor function $\mathop{{\sum}'}\limits_{mn\leq x}\cos(2\pi m\theta_1)\sin(2\pi n\theta_2)$, where $\theta_i (0<\theta_i<1)$ is a rational number. By connecting it with the divisor problem with congruence conditions,…

Isolating the real roots of univariate polynomials is a fundamental problem in symbolic computation and it is arguably one of the most important problems in computational mathematics. The problem has a long history decorated with numerous…

Dependent Object Types (DOT) is a calculus with path dependent types, intersection types, and object self-references, which serves as the core calculus of Scala 3. Although the calculus has been proven sound, it remains open whether type…

We consider Dirichlet elliptic equations driven by the sum of a $p$-Laplacian $(2<p)$ and a Laplacian. The conditions on the reaction term imply that the problem is resonant at both $\pm\infty$ and at zero. We prove an existence theorem…

Dummett's argument for intuitionism is well known. There is a concern that the argument proves too much, specifically, that it supports the extreme and apparently incoherent position of strict finitism. The central question is how to…

We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…

A general class of transcendental equations in complex domain is considered for functions belonging to the Stieltjes cone. Under certain conditions each transcendental equation has no solution or one, at most, in the complex plane cut along…

We introduce a new algorithm denoted DSC2 to isolate the real roots of a univariate square-free polynomial f with integer coefficients. The algorithm iteratively subdivides an initial interval which is known to contain all real roots of f.…

We study existence and uniqueness of bounded solutions to a fractional sublinear elliptic equation with a variable coefficient, in the whole space. Existence is investigated in connection to a certain fractional linear equation, whereas the…

The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In…

This paper enriches preexisting satisfiability tests for unquantified languages, which in turn augment a fragment of Tarski's elementary algebra with unary real functions possessing a continuous first derivative. Two sorts of individual…

Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…

We present algorithmic and complexity results concerning computations with one and two real algebraic numbers, as well as real solving of univariate polynomials and bivariate polynomial systems with integer coefficients using Sturm-Habicht…

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…