Related papers: A New Approach to Constructing Quadratic Pseudo-Pl…
Recent work has shown the surprising power of low-degree sandwiching polynomial approximators in the context of challenging learning settings such as learning with distribution shift, testable learning, and learning with contamination. A…
In this paper, we define finitely additive, probability and modular functions over semiring-like structures. We investigate finitely additive functions with the help of complemented elements of a semiring. We also generalize some classical…
A fake projective plane is a smooth complex surface which is not the complex projective plane but has the same Betti numbers as the complex projective plane. The first example of such a surface was constructed by David Mumford in 1979 using…
A symmetric pseudo-Boolean function is a map from Boolean tuples to real numbers which is invariant under input variable interchange. We prove that any such function can be equivalently expressed as a power series or factorized. The kernel…
We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach…
We study the phenomena that arise when we combine the standard pseudodifferential operators with those operators that appear in the study of some sub-elliptic estimates, and on strongly pseudoconvex domains. The algebra of operators we…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
In this paper we construct a hierarchy of multivariate polynomial approximation kernels via semidefinite programming. We give details on the implementation of the semidefinite programs defining the kernels. Finally, we show how a symmetry…
The ${\mathcal D}$-pseudo-boson formalism is illustrated with two examples. The first one involves deformed complex Hermite polynomials built using finite-dimensional irreducible representations of the group ${\rm GL}(2,{\mathbb C})$ of…
{We explore a simple {\it geometric model} for functions between spaces of the same dimension (in infinite dimensions, we require that Jacobians be Fredholm operators of index zero). The model combines standard results in analysis and…
In this paper we present a new class of perfect nonlinear %Dembowski-Ostrom polynomials over $\mathbb{F}_{p^{2k}}$ for any odd prime $p$. In addition, we show that the new perfect nonlinear functions are CCZ-inequivalent to all the…
Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes,…
The main purpose of this paper is to compute all irreducible spherical functions on $G=\SU(3)$ of arbitrary type $\delta\in \hat K$, where $K={\mathrm{S}}(\mathrm{U}(2)\times\mathrm{U}(1))\simeq\mathrm{U}(2)$. This is accomplished by…
In this paper, we study square functions for extension operators over finite-type, planar curves endowed with the Euclidean arclength measure. We prove new results for curves of the form $(T,\phi(T))$ where $\phi(T)$ is a polynomial of…
Quasi-conformal actions were introduced in the physics literature as a generalization of the familiar fractional linear action on the upper half plane, to Hermitian symmetric tube domains based on arbitrary Jordan algebras, and further to…
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda + \sum_{k = 1}^d [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are linear forms in…
In this paper, we compare two optimization algorithms using full Hessian and approximation Hessian to obtain numerical spherical designs through their variational characterization. Based on the obtained spherical design point sets, we…
Polynomial functions on the group of units Q_n of the ring Z_{2^n} are considered. A finite set of reduced polynomials RP_n in Z[x] that induces the polynomial functions on Q_n is determined. Each polynomial function on Q_n is induced by a…
Thanks to a new construction of the so-called Chudnovsky-Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in finite fields. They are tailored to hardware implementation…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…