Related papers: Parametric Presburger Arithmetic: Complexity of Co…
Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set $B$ of real functions semialgebraic over the rationals. Consider the class of boolean decision…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
S\'ark\"ozy proved that dense sets of integers contain two elements differing by a $k$th power. The bounds in quantitative versions of this theorem are rather weak compared to what is expected. We prove a version of S\'ark\"ozy's theorem…
We establish well-posedness and maximal regularity estimates for linear parabolic SPDE in divergence form involving random coefficients that are merely bounded and measurable in the time, space, and probability variables. To reach this…
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
In this paper we describe an algorithm that takes as input a description of a semi-algebraic set $S \subset \R^k$, defined by a Boolean formula with atoms of the form $P > 0, P < 0, P=0$ for $P \in {\mathcal P} \subset \R[X_1,...,X_k],$ and…
For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…
In this paper we obtain asymptotic formulas of arbitrary order for the Bloch eigenvalue and the Bloch function of the periodic Schrodinger operator of arbitrary dimension, when corresponding quasimomentum lies near a diffraction hyperplane.…
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
We study structural aspects of randomized parameterized computation. We introduce a new class ${\sf W[P]}$-${\sf PFPT}$ as a natural parameterized analogue of ${\sf PP}$. Our definition uses the machine based characterization of the…
Ilse Fischer and the second author introduced in [Algebr. Comb. 7 (2024), no. 5, 1319-1345] a two parameter family of polynomials defined as sums over totally symmetric plane partitions and connected to alternating sign matrices and…
Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called Sylvester waves) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…
Let $F$ be a number field. Given a quadratic polynomial $f_c(z) = z^2 + c \in F[z]$, we can construct a directed graph $Preper(f_c, F)$ (also called a portrait), whose vertices are $F$-rational preperiodic points for $f_c$, with an edge…
We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…
The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the parameter) and B\"ackstr\"om et al. (2012) picked up this…
Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…
A function on a (generally infinite) graph $\G$ with values in a field $K$ of characteristic 2 will be called {\it harmonic} if its value at every vertex of $\G$ is the sum of its values over all adjacent vertices. We consider binary…
Like all other knot polynomials, the superpolynomials should be defined in arbitrary representation R of the gauge group in (refined) Chern-Simons theory. However, not a single example is yet known of a superpolynomial beyond symmetric or…
We use a function field analogue of a method of Selberg to derive an asymptotic formula for the number of (square-free) monic polynomials in $\mathbb{F}_q[X]$ of degree $n$ with precisely $k$ irreducible factors, in the limit as $n$ tends…