Related papers: New results on quasi-subfield polynomials
A second-order differential (q-difference) eigenvalue equation is constructed whose solutions are generating functions of the dual (q-)Hahn polynomials. The fact is noticed that these generating functions are reduced to the (little…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
We study automorphisms and representations of quasi polynomial algebras (QPAs) and quasi Laurent polynomial algebras (QLPAs). For any QLPA defined by an arbitrary skew symmetric integral matrix, we explicitly describe its automorphism…
We give a deterministic algorithm for approximately counting satisfying assignments of a degree-$d$ polynomial threshold function (PTF). Given a degree-$d$ input polynomial $p(x_1,\dots,x_n)$ over $R^n$ and a parameter $\epsilon> 0$, our…
The spaces of quasi-invariant polynomials were introduced by Chalykh and Veselov [Comm. Math. Phys. 126 (1990), 597-611]. Their Hilbert series over fields of characteristic 0 were computed by Feigin and Veselov [Int. Math. Res. Not. 2002…
In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for…
We propose a theoretical framework to analyze semi-supervised classification under the low density separation assumption in a high-dimensional regime. In particular, we introduce QLDS, a linear classification model, where the low density…
This work focuses on the existence of quasi-periodic solutions for ordinary and delay differential equations (ODEs and DDEs for short) with an elliptic-type degenerate equilibrium point under quasi-periodic perturbations. We prove that…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
We propose a novel way of computing surface folding maps via solving a linear PDE. This framework is a generalization to the existing quasiconformal methods and allows manipulation of the geometry of folding. Moreover, the crucial quantity…
This paper proposes new quadratic constraints (QCs) to bound a quadratic polynomial. Such QCs can be used in dissipation ineqaulities to analyze the stability and performance of nonlinear systems with quadratic vector fields. The proposed…
Proving super-polynomial size lower bounds for $\textsf{TC}^0$, the class of constant-depth, polynomial-size circuits of Majority gates, is a notorious open problem in complexity theory. A major frontier is to prove that $\textsf{NEXP}$…
A rational polytope is the convex hull of a finite set of points in $\R^d$ with rational coordinates. Given a rational polytope $P \subseteq \R^d$, Ehrhart proved that, for $t\in\Z_{\ge 0}$, the function $#(tP \cap \Z^d)$ agrees with a…
We present several new algorithms to evaluate modular polynomials of level $\ell$ modulo a prime $p$ on an input $j$. More precisely, we introduce two new generic algorithms, sharing the following similarities: they are based on a CRT…
The purpose of this paper is to prove local upper and lower bounds for weak solutions of semilinear elliptic equations of the form $-\Delta u= c u^p$, with $0<p<p_s=(d+2)/(d-2)$, defined on bounded domains of $\RR^d$, $d\ge 3$, without…
We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
We introduce a new constructive method for establishing lower bounds on convergence rates of periodic homogenization problems associated with divergence type elliptic operators. The construction is applied in two settings. First, we show…
We propose a more direct approach to constructing differential operators that preserve polynomial subspaces than the one based on considering elements of the enveloping algebra of sl(2). This approach is used here to construct new exactly…
This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality…