Related papers: One-Way Functions and Polynomial Time Dimension

For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…

We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives…

We consider a one-dimensional stationary stochastic process $x(\tau)$ of duration $T$. We study the probability density function (PDF) $P(t_{\rm m}|T)$ of the time $t_{\rm m}$ at which $x(\tau)$ reaches its global maximum. By using a path…

The bivariate normal density with unit variance and correlation $\rho$ is well-known. We show that by integrating out $\rho$, the result is a function of the maximum norm. The Bayesian interpretation of this result is that if we put a…

We show that unary log-analytic functions are polynomially bounded. In the higher dimensional case globally a log-analytic function can have exponential growth. We show that a log-analytic function is polynomially bounded on a definable set…

In this paper, we develop a theory of new classes of discrete convex functions, called L-extendable functions and alternating L-convex functions, defined on the product of trees. We establish basic properties for optimization: a…

The equilibrium statistical mechanics of classical directed polymers in 2 dimensions is well known to be equivalent to the imaginary-time quantum dynamics of a 1+1-dimensional many-particle system, with polymer configurations corresponding…

In "Reliable Communication in the Absence of a Common Clock" (Yeung et al., 2009), the authors introduce general run-length sets, which form a class of constrained systems that permit run-lengths from a countably infinite set. For a…

Existing depth separation results for constant-depth networks essentially show that certain radial functions in $\mathbb{R}^d$, which can be easily approximated with depth $3$ networks, cannot be approximated by depth $2$ networks, even up…

This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…

The spherical functions of the noncompact Grassmann manifolds $G_{p,q}(\mathbb F)=G/K$ over the (skew-)fields $\mathbb F=\mathbb R, \mathbb C, \mathbb H$ with rank $q\ge1$ and dimension parameter $p>q$ can be described as Heckman-Opdam…

Particulate matter data now include various particle sizes, which often manifest as a collection of curves observed sequentially over time. When considering 51 distinct particle sizes, these curves form a high-dimensional functional time…

Let $P_1, \ldots, P_m \in K[y]$ be polynomials with distinct degrees, no constant terms and coefficients in a general locally compact topological field $K$. We give a quantitative count of the number of polynomial progressions $x, x+P_1(y),…

We provide sufficient density condition for a set of nonuniform samples to give rise to a set of sampling for multivariate bandlimited functions when the measurements consist of pointwise evaluations of a function and its first $k$…

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

Dempster-Shafer theory is widely applied in uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. A distance between two basic probability assignments(BPAs) presents a measure of performance…

We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…

This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…

For any given partial order in a $d$-dimensional euclidean space, under mild regularity assumptions, we show that the intersection of closed (generalized) intervals containing more than 1/2 of the probability mass, is a non-empty compact…

We characterize when bivariate real analytic functions are "dimension expanding" when applied to a Cartesian product. If $P$ is a bivariate real analytic function that is not locally of the form $P(x,y) = h(a(x) + b(y))$, then whenever $A$…