Related papers: One-Way Functions and Polynomial Time Dimension
The mapping of time-dependent densities on potentials in quantum mechanics is critically examined. The issue is of significance ever since Runge and Gross (Phys. Rev. Lett. 52, 997 (1984)) established the uniqueness of the mapping, forming…
For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…
The purpose of this paper is to obtain some sufficient conditions to determine the relation between a meromorphic function and an L-function when certain differential polynomial generated by them sharing a one degree polynomial. The main…
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absorbing walls for the one-dimensional case. We compute these…
We consider the pairing Hamiltonian and systematically construct its density functional in the strong-coupling limit and in the limit of large particle number. In the former limit, the functional is an expansion into central moments of…
Accurate reconstruction of probability density functions (PDFs) from data is essential in engineering applications. Classical global moment-based polynomial approximations often suffer from oscillations, instability in the tails, and…
We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically…
In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…
The polygonal distributions are a class of distributions that can be defined via the mixture of triangular distributions over the unit interval. The class includes the uniform and trapezoidal distributions, and is an alternative to the beta…
In this paper we compare two polymer stretching experiments. The outcome of both experiments is a force-extension relation. We use a one-dimensional model to show that in general the two quantities are not equal. In certain limits, however,…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
Position probability distribution of a set of massive mutually exclusive particles in one dimension has been defined. Examples with a given two mutually exclusive particles system are considered. It is emphasized that quantum particles at…
In this note we connect Sobolev estimates in the context of polynomial averages e.g. \[ \| \int_0^1 \prod_{k=1}^m f_k(x-t^k) \|_{1} \leq \text{Const} \cdot 2^{-\text{const} \cdot l} \prod_{i=1}^m \| f_k \|_m \] whenever some $f_i$ vanishes…
We consider a randomly forced Ginzburg-Landau equation on an unbounded domain. The forcing is smooth and homogeneous in space and white noise in time. We prove existence and smoothness of solutions, existence of an invariant measure for the…
Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…
We show that for every $k \in \mathbb{N}$ there exists $C > 0$ such that if $p^k \ge C \log^8 n / n$ then asymptotically almost surely the random graph $G_{n,p}$ contains the $k$\textsuperscript{th} power of a Hamilton cycle. This…
In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…
We present a dichotomy theorem on the parameterized complexity of the 3-uniform hypergraphicality problem. Given $0<c_1\le c_2 < 1$, the parameterized 3-uniform Hypergraphic Degree Sequence problem, $3uni-HDS_{c_1,c_2}$, considers degree…
We demonstrate that the probability density of a quantum state moving freely in one dimension may decay faster than 1/t. Inverse quadratic and cubic dependences are illustrated with analytically solvable examples. Decays faster than 1/t…
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with bounded thinness,…