Related papers: Fooling functions of halfspaces under product dist…
Straight-line programs are a central tool in several areas of computer science, including data compression, algebraic complexity theory, and the algorithmic solution of algebraic equations. In the algebraic setting, where straight-line…
We generalize earlier results on one-point functions in N = 4 SYM with a co-dimension one defect, dual to the D3-D5-brane setup in type IIB string theory on AdS5xS5, to a similar setup in the $\beta$-deformed version of the theory. The…
In this note we present a new special function that behaves like the error function and we provide an approximated accurate closed form for its CDF in terms of both Chebyshev polynomials of the first kind and the error function. Also, we…
We continue our study and applications of generalized H\"ormander spaces of distributions $\mathcal{D}'_{\gamma,\Lambda}$ with $C^\infty$ wavefront set included in a cone $\Lambda$ and the union of $H^s$-wave front sets in a second cone…
For a fixed positive integer $d$ and a small real $p>0$, sample a $p$-random subset $A \subseteq \mathbb{Z}_{\geq 0}^d$, and let $S:=\langle A \rangle$ be the generalized numerical semigroup generated by $A$. We show that with high…
We introduce a novel family of expander-based error correcting codes. These codes can be sampled with randomness linear in the block-length, and achieve list-decoding capacity (among other local properties). Our expander-based codes can be…
In this paper, we consider situations in which a given logical function is realized by a multithreshold threshold function. In such situations, constant functions can be easily obtained from multithreshold threshold functions, and…
Given an operad P with a finite Groebner basis of relations, we study the generating functions for the dimensions of its graded components P(n). Under moderate assumptions on the relations we prove that the exponential generating function…
We consider the isotropic perimeter generating functions of three-choice, imperfect, and 1-punctured staircase polygons, whose 8th order linear Fuchsian ODEs are previously known. We derive simple relationships between the three generating…
We obtain exact formulas for moments and generating functions of the height function of the asymmetric simple exclusion process at one spatial point, starting from special initial data in which every positive even site is initially…
We study the eigenvalues for infinitesimal generators of semigroups of composition operators acting on Hardy spaces, Bergman spaces, and the Dirichlet space. Such semigroups are induced by semigroups of holomorphic functions. Depending on…
The recent line of study on randomness extractors has been a great success, resulting in exciting new techniques, new connections, and breakthroughs to long standing open problems in several seemingly different topics. These include seeded…
We give the first fully polynomial-time algorithm for learning halfspaces with respect to the uniform distribution on the hypercube in the presence of contamination, where an adversary may corrupt some fraction of examples and labels…
Processes of random tessellations of the Euclidean space $\mathbb{R}^d$, $d\geq 1$, are considered which are generated by subsequent division of their cells. Such processes are characterized by the laws of the life times of the cells until…
We introduce analogs of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. When the color set is a semigroup, an internal product can be introduced. This leads to the construction of generalized…
We discuss exclusive $\phi$-meson electroproduction off the proton near threshold within the GPD factorization framework. We propose the `threshold approximation' in which only the leading term of the conformal partial wave expansion of the…
It is folklore that a power bounded operator on a sequentially complete locally convex space generates a uniformly continuous $C_0$-semigroup which is given by the corresponding power series representation. Recently, Doma\'nski asked if in…
Learning intersections of halfspaces is a central problem in Computational Learning Theory. Even for just two halfspaces, it remains a major open question whether learning is possible in polynomial time with respect to the margin $\gamma$…
We consider low-space algorithms for the classic Element Distinctness problem: given an array of $n$ input integers with $O(\log n)$ bit-length, decide whether or not all elements are pairwise distinct. Beame, Clifford, and Machmouchi [FOCS…
Sub-categories of mathematical topology, like the mathematical theory of chaos, offer interesting applications devoted to information security. In this research work, we have introduced a new chaos-based pseudorandom number generator…