Related papers: Reducibility of rational functions in several vari…
Let $X,Y$ be two irreducible subvarieties of the projective space $\mathbb{P}^n$, and $d\geq 1$ an integer number. The main result of this paper is an algorithm to construct {\bf explicitly}, in terms of $d$ and the ideals defining $X$ and…
Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…
We prove a functional limit theorem for vector-valued functionals of the fractional Ornstein-Uhlenbeck process, providing the foundation for the fluctuation theory of slow/fast systems driven by such a noise. Our main contribution is on the…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
We give a direct and elementary proof of the theorem on formal functions by studying the behaviour of the Godement resolution of a sheaf of modules under completion.
A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…
We extend a result of Yun on minimal reduction types to the parahoric case. This implies a uniqueness property for 2-special representations appearing in the cohomology of certain affine Springer fibers. Using this, we settle a conjecture…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…
Using deformation theory of rational curves, we prove a conjecture of Sommese on the extendability of morphisms from ample subvarieties when the morphism is a smooth (or mildly singular) fibration with rationally connected fibers. We apply…
Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…
Kronecker's Theorem and Rabin's Theorem are fundamental results about computable fields F and the decidability of the set of irreducible polynomials over F. We adapt these theorems to the setting of differential fields K, with constrained…
We investigate the problem of deciding whether the restriction of a rational function $r\in\mathbb{K}(x,y)$ to the curve associated with an irreducible polynomial $p\in\mathbb{K}[x,y]$ is the restriction of an element of…
Using elementary methods we find surprising connections between the values of the Riemann Zeta Function over integers and the fractional parts of rational powers, and a connection between the Riemann Zeta Function and the Prime Zeta…
We analyse the philosopher Davidson's semantics of actions, using a strongly typed logic with contexts given by sets of partial equations between the outcomes of actions. This provides a perspicuous and elegant treatment of reasoning about…
We prove a version of the reduction principle for functionals of vector long-range dependent random fields. The components of the fields may have different long-range dependent behaviours. The results are illustrated by an application to…
An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that…
This work shows that for rational multivariate functions, the Kolmogorov Superposition Theorem (KST) involves several single-variable functions, which can be written down by inspection. In other words, no computation is required for…
We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…