相关论文: Counting real rational functions with all real cri…
Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…
In this paper we present an algorithm to compute all unirational fields of transcendence degree one containing a given finite set of multivariate rational functions. In particular, we provide an algorithm to decompose a multivariate…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…
We study a natural complexity measure of Boolean functions known as the rational degree. Denoted $\textrm{rdeg}(f)$, it is the minimal degree of a rational function that is equal to $f$ on the Boolean hypercube. For total functions $f$, it…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
This note will study complex polynomial maps of degree $n\ge 2$ with only one critical point.
Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…
The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic properties, and the field of analytic combinatorics in several…
A "practical number" is a positive integer $n$ such that every positive integer less than $n$ can be written as a sum of distinct divisors of $n$. We prove that most of the binomial coefficients are practical numbers. Precisely, letting…
For a rational function of several variables with nonnegative imaginary part on the upper poly-half-plane, the matrix representations are obtained.
If a linear differential operator with rational function coefficients is reducible, its factors may have coefficients with numerators and denominatorsof very high degree. When the base field is $\mathbb C$, we give a completely explicit…
In this paper, some sufficient conditions for the differentiability of the $n$-variable real-valued function are obtained, which are given based on the differentiability of the $n-1$-variable real-valued function and are weaker than…
We compute critical exponents of O(N) models in fractal dimensions between two and four, and for continuos values of the number of field components N, in this way completing the RG classification of universality classes for these models. In…
A complex-analytic structure within the unit disk of the complex plane is presented. It can be used to represent and analyze a large class of real functions. It is shown that any integrable real function can be obtained by means of the…
We determine all degree-4 rational functions f(X) in F_q(X) which permute P^1(F_q), and answer two questions of Ferraguti and Micheli about the number of such functions and the number of equivalence classes of such functions up to composing…
The calculation and manipulation of large multi-variable rational functions is a key bottleneck in multi-loop calculations. In these conference proceedings, based on my article [Chawdhry (2023) arXiv:2312.03672], I present a technique to…
We study real-time scalar $\phi^4$-theory in 2+1 dimensions near criticality. Specifically, we compute the single-particle spectral function and that of the $s$-channel four-point function in and outside the scaling regime. The computation…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…