Related papers: All Classical Adversary Methods are Equivalent for…

The polynomial method and the Ambainis's lower bound (or \emph{Alb}, for short) method are two main quantum lower bound techniques. While recently Ambainis showed that the polynomial method is not tight, the present paper aims at studying…

Let $\{P_t\}_{t>0}$ be the Dunkl-Poisson semigroup associated with a root system $R\subset \mathbb R^N$ and a multiplicity function $k\geq 0$. Analogously to the classical theory, we say that a bounded measurable function $f$ defined on…

Effectivity functions are the basic formalism for investigating the semantics game logic. We discuss algebraic properties of stochastic effectivity functions, in particular the relationship to stochastic relations, morphisms and congruences…

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

We study the consistency of surrogate risks for robust binary classification. It is common to learn robust classifiers by adversarial training, which seeks to minimize the expected $0$-$1$ loss when each example can be maliciously corrupted…

Let $\mathcal{S}^*(\alpha_1,\alpha_2)$, where $ \alpha_1, \alpha_2 \in (0,1]$, represent the class of functions $f$ that are analytic in the open unit disk $\mathbb{D}$, normalized by $f(0) = f'(0) - 1=0$, and satisfying the following…

We consider robust low rank matrix estimation as a trace regression when outputs are contaminated by adversaries. The adversaries are allowed to add arbitrary values to arbitrary outputs. Such values can depend on any samples. We deal with…

We introduce new techniques for proving lower bounds on the running time of randomized algorithms for asynchronous agreement against powerful adversaries. In particular, we define a \emph{strongly adaptive adversary} that is computationally…

We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a…

We investigate the algebraic genericity of various families of continuous functions exhibiting extreme irregularity, focusing on fractal dimensions, H\"older regularity, and fractional differentiability. Our first main result shows that for…

Trigonometric formulas are derived for certain families of associated Legendre functions of fractional degree and order, for use in approximation theory. These functions are algebraic, and when viewed as Gauss hypergeometric functions,…

We show conflict complexity of every total Boolean function, recently introduced in [Swagato Sanyal. A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to prove a composition theorem of randomized decision…

Let $k$ be an algebraically closed field of characteristic $p>0$, let $R$ be a commutative ring and let $\mathcal{F}$ be an algebraically closed field of characteristic $0$. We introduce the category $\overline{\mathcal{F}_{Rpp_k}}$ of…

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…

We consider some second order quasilinear partial differential inequalities for real valued functions on the unit ball and find conditions under which there is a lower bound for the supremum of nonnegative solutions that do not vanish at…

In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…

This paper uncovers the fundamental relationship between total and partial computation in the form of an equivalence of certain categories. This equivalence involves on the one hand effectuses, which are categories for total computation,…

The main goal of this work is to perform a nonolonomic deformation (Fedosov type) quantization of fractional Lagrange geometries. The constructions are provided for a (fractional) almost Kahler model encoding equivalently all data for…

Consider a semi-algebraic function $f\colon\mathbb{R}^n \to {\mathbb{R}},$ which is continuous around a point $\bar{x} \in \mathbb{R}^n.$ Using the so--called {\em tangency variety} of $f$ at $\bar{x},$ we first provide necessary and…

Functions with low c-differential uniformity have optimal resistance to some types of differential cryptanalysis. In this paper, we investigate the c-differential uniformity of power functions over finite fields. Based on some known almost…