Related papers: All Classical Adversary Methods are Equivalent for…
Kolmogorov-Arnold Networks (KANs) offer a promising framework for approximating complex nonlinear functions, yet the original B-spline formulation suffers from significant computational overhead due to De Boor algorithm. While recent…
When a function belonging to a fractional-order Sobolev space is supported in a proper subset of the Lipschitz domain on which the Sobolev space is defined, how is its Sobolev norm as a function on the smaller set compared to its norm on…
In this article, we impose a new class of fractional analytic functions in the open unit disk. By considering this class, we define a fractional operator, which is generalized Salagean and Ruscheweyh differential operators. Moreover, by…
Assume that $\Delta$ is the open unit disk in the complex plane and $\mathcal{A}$ is the class of normalized analytic functions in $\Delta$. In this paper we introduce and study the class \begin{equation*} \mathcal{BS}(\alpha):=\left\{f\in…
Several classes of DNR functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of…
Let $\R(\cdot)$ stand for the bounded-error randomized query complexity. We show that for any relation $f \subseteq \{0,1\}^n \times \mathcal{S}$ and partial Boolean function $g \subseteq \{0,1\}^n \times \{0,1\}$, $\R_{1/3}(f \circ g^n) =…
We prove that the partition rank and the analytic rank of tensors are equal up to a constant, over finite fields of any characteristic and any large enough cardinality depending on the analytic rank. Moreover, we show that a plausible…
In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…
The classical and the fractional Laplacians exhibit a number of similarities, but also some rather striking, and sometimes surprising, structural differences. A quite important example of these differences is that any function (regardless…
Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The…
This work studies exact solvability of a class of fractional reaction-diffusion equation with the Riemann-Liouville fractional derivatives on the half-line in terms of the similarity solutions. We derived the conditions for the equation to…
We consider the class $\mathcal{S}^*(q_c)$ of normalized starlike functions $f$ analytic in the open unit disk $|z|<1$ that satisfying the inequality \begin{equation*} \left|\left(\frac{zf'(z)}{f(z)}\right)^2-1\right|<c \quad (0<c\leq1).…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
Current adversarial attack research reveals the vulnerability of learning-based classifiers against carefully crafted perturbations. However, most existing attack methods have inherent limitations in cross-dataset generalization as they…
We give a simpler proof, via query elimination, of a result due to O'Donnell, Saks, Schramm and Servedio, which shows a lower bound on the zero-error randomized query complexity of a function f in terms of the maximum influence of any…
We approximate functions defined on smooth bounded domains by elements of the eigenspaces of the Laplacian or the Stokes operator in such a way that the approximations are bounded and converge in both Sobolev and Lebesgue spaces. We prove…
Submodular and fractionally subadditive (or equivalently XOS) functions play a fundamental role in combinatorial optimization, algorithmic game theory and machine learning. Motivated by learnability of these classes of functions from random…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We define a new query measure we call quantum distinguishing complexity, denoted QD(f) for a Boolean function f. Unlike a quantum query algorithm, which must output a state close to |0> on a 0-input and a state close to |1> on a 1-input, a…
This article contains several results for \lambda-Robertson functions, i.e., analytic functions $f$ defined on the unit disk $D$ satisfying $f(0) = f'(0)-1=0$ and $Re e^{-i\lambda} {1+zf"(z)/f'(z)} > 0$ in $D$, where $\lambda \epsilon…