Related papers: Creating Strong Total Commutative Associative Comp…
We establish the global existence of a class of strongly coupled parabolic systems. The necessary apriori estimates will be obtained via our new approach to the regularity theory of parabolic scalar equations with integrable data and new…
We prove that path puzzles with complete row and column information--or equivalently, 2D orthogonal discrete tomography with Hamiltonicity constraint--are strongly NP-complete, ASP-complete, and #P-complete. Along the way, we newly…
We prove that P != NP by proving the existence of a class of functions we call Tau, each of whose members satisfies the conditions of one-way functions. Each member of Tau is a function computable in polynomial time, with negligible…
This paper investigates certain classes of entire functions in C^n that, together with their partial derivatives, share a finite set consisting of three elements. By employing normality criteria, we study the behaviour of such functions and…
Kolmogorov famously proved that multivariate continuous functions can be represented as a superposition of a small number of univariate continuous functions, $$ f(x_1,\dots,x_n) = \sum_{q=0}^{2n+1} \chi^q \left( \sum_{p=1}^n \psi^{pq}(x_p)…
Distributional collision resistance is a relaxation of collision resistance that only requires that it is hard to sample a collision $(x,y)$ where $x$ is uniformly random and $y$ is uniformly random conditioned on colliding with $x$. The…
We show that the fixed point subnet of a strongly additive conformal net under the action of a compact group is strongly additive. Using the idea of the proof we define the notion of strong additivity for a pair of conformal nets and we…
One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., $\mathbf{P}\not\subseteq\mathbf{NC}^1$). Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995)…
One-dimensional atomic mixtures of fermions can effectively realize spin chains and thus constitute a clean and controllable platform to study quantum magnetism. Such strongly correlated quantum systems are also of sustained interest to…
The goal of this paper is to introduce ideas and methodology of the generic case complexity to cryptography community. This relatively new approach allows one to analyze the behavior of an algorithm on ''most'' inputs in a simple and…
We generalize to the setting of Arveson's maximal subdiagonal subalgebras of finite von Neumann algebras, the Szeg\"o $L^p$-distance estimate, and classical theorems of F. and M. Riesz, Gleason and Whitney, and Kolmogorov. In so doing, we…
To study the communication between information systems, Wang et al. [C. Wang, C. Wu, D. Chen, Q. Hu, and C. Wu, Communicating between information systems, Information Sciences 178 (2008) 3228-3239] proposed two concepts of type-1 and type-2…
We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state generators, if we allow the public verification key to be…
We study conditions for the existence of stable and group-strategy-proof mechanisms in a many-to-one matching model with contracts if students' preferences are monotone in contract terms. We show that "equivalence", properly defined, to a…
We provide a non-interactive quantum bit commitment scheme which has statistically-hiding and computationally-binding properties from any quantum one-way function. Our protocol is basically a parallel composition of the previous…
We show that the classical kernel and domain functions associated to an n-connected domain in the plane are all given by rational combinations of three or fewer holomorphic functions of one complex variable. We characterize those domains…
In 2023, Li, Du, Yi proved a uniqueness theorem for L functions in the extended Selberg class under the assumptions of positive degree, a shared functional equation, and the sharing of three complex values. This was later strengthened by…
This paper is concerned with path-complete barrier functions which offer a graph-based methodology for verifying safety properties in switched systems. The path-complete framework leverages algebraic (barrier functions) as well as…
We show that the (topological) full group of a minimal pseudogroup over the Cantor set satisfies various rigidity phenomena of topological dynamical and combinatorial nature. Our main result applies to its possible homomorphisms into other…
The aim of this paper is to prove the existence of common fixed points for a pair of weakly compatible selfmaps satisfying weakly contractive condition and property (E. A). In this context, first we modify Beg and Abbas theorem (\cite{Beg},…