Related papers: One-Way Functions and Polynomial Time Dimension
We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in array grammars. First we show that the emptiness problem for…
For discrete-time causal linear input/state/output systems, the Bounded Real Lemma explains (under suitable hypotheses) the contractivity of the values of the transfer function over the unit disk for such a system in terms of the existence…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
Kifer, Peres and Weiss showed that the Bernoulli measures for the Gauss map $T(x)= \frac{1}{x} \mod 1$ satisfy a `dimension gap' meaning that for some $c>0$, $\sup_{\mathbf{p}} \dim \mu_{\mathbf{p}} <1-c$, where $\mu_{\mathbf{p}}$ denotes…
We study the problem of finding the $k$ most similar trajectories to a given query trajectory. Our work is inspired by the work of Grossi et al. [6] that considers trajectories as walks in a graph. Each visited vertex is accompanied by a…
In this paper we investigate the (Kohn-Sham) density-to-potential map in the case of spinless fermions in one spatial dimension, whose existence has been rigorously established by the first author in [arXiv:2504.05501 (2025)]. Here, we…
Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
During last two decades it has been discovered that the statistical properties of a number of microscopically rather different random systems at the macroscopic level are described by {\it the same} universal probability distribution…
We study holomorphic functions attaining weighted norms and its connections with the classical theory of norm attaining holomorphic functions. We prove that there are polynomials on $\ell_p$ which attain their weighted but not their…
Asymptotic methods for hypothesis testing in high-dimensional data usually require the dimension of the observations to increase to infinity, often with an additional relationship between the dimension (say, $p$) and the sample size (say,…
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular set functions, answering an open question posed in 1981 by Grotschel, Lovasz, and Schrijver. The algorithm employs a scaling scheme that uses a…
Long DNA molecules can be mapped by cutting them with restriction enzymes inside a narrow channel. Once cut, the individual fragments thus produced move away from each other due to diffusion and entropic effects. We investigate how long it…
The Renyi, Shannon and Fisher spreading lengths of the classical or hypergeometric orthogonal polynomials, which are quantifiers of their distribution all over the orthogonality interval, are defined and investigated. These…
In computational complexity, a complexity class is given by a set of problems or functions, and a basic challenge is to show separations of complexity classes $A \not= B$ especially when $A$ is known to be a subset of $B$. In this paper we…
Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing…
Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the guessing entropy, and channel capacity. This paper investigates the…
Kawamura and Cook specified the least set of information about a continuous function on the unit interval which is needed for fast function evaluation. This paper presents a variation of their result. To make the above statement precise,…