Related papers: No Efficient Disjunction or Conjunction of Switch-…
A very promising approach to obtain efficient upconversion of light is the use of triplet-triplet annihilation of excitations in molecular systems. In real materials, besides upconversion, many other physical processes take place -…
The unification of gauge couplings suggests that there is an underlying (supersymmetric) unification of the strong, electromagnetic and weak interactions. The prediction of the unification scale may be the first quantitative indication that…
The time evolution of a particle, caught in an infinitely deep square well, displays unexpected features, when one includes tiny relativistic effects. Indeed, even the smallest corrections to the non-relativistic quadratic spectrum manifest…
In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a…
The 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar:…
We consider the general question of estimating decay of correlations for non-uniformly expanding maps, for classes of observables which are much larger than the usual class of Holder continuous functions. Our results give new estimates for…
Selection among autocatalytic species fundamentally depends on their growth law: exponential species, whose number of copies grows exponentially, are mutually exclusive, while sub-exponential ones, whose number of copies grows polynomially,…
A power-free language is characterized by the number of symbols used and a limit on how many times a block of symbols can repeat consecutively. For certain values of these parameters, it is known that the number of legal words grows…
Binary mixtures growing on small-world networks under far-from-equilibrium conditions are studied by means of extensive Monte Carlo simulations. For any positive value of the shortcut fraction of the network ($p>0$), the system undergoes a…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of "size-change graphs". We present algorithms…
Take any $d + 3$ points in $\mathbb{R}^d$. It is known that (a) if $d = 2k + 1$, then there are two linked $(k + 1)$-simplices with the vertices at these points; (b) if $d = 2k$, then there are two disjoint $(k + 1)$-tuples of these points…
Finding unambiguous diagrammatic representations for first-order logical formulas and relational queries with arbitrarily nested disjunctions has been a surprisingly long-standing unsolved problem. We refer to this problem as the…
We analyze the large-$N$ expansion of general non-equilibrium systems with fluctuating matrix degrees of freedom and $SU(N)$ symmetry, using the Schwinger-Keldysh formalism and its closed real-time contour with a forward and backward…
We found that models of evolving random networks exhibit dynamic scaling similar to scaling of growing surfaces. It is demonstrated by numerical simulations of two variants of the model in which nodes are added as well as removed [Phys.…
The aim of this paper is to refine some results concerning the blow-up of solutions of the exponential reaction-diffusion equation. We consider solutions that blow-up in finite time, but continue to exist as weak solutions beyond the…
We show that chiral order in two-dimensional nonreciprocal flocking mixtures is generically unstable. Combining large-scale agent-based simulations with a coarse-grained continuum description, we demonstrate that rotating chiral states…
This paper is devoted to finite state automata, regular expression matching, pattern recognition, and the exponential blow-up problem, which is the growing complexity of automata exponentially depending on regular expression length. This…
Breaking of ensemble equivalence between the microcanonical ensemble and the canonical ensemble may occur for random graphs whose size tends to infinity, and is signaled by a non-zero specific relative entropy of the two ensembles. In [3]…
An appealing explanation for the Planck data is provided by inflationary models with a singular non-canonical kinetic term: a Laurent expansion of the kinetic function translates into a potential with a nearly shift-symmetric plateau in…