Related papers: A simple proof for monotone CLT
We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently…
We consider the spectral properties of a class of regularized estimators of (large) empirical covariance matrices corresponding to stationary (but not necessarily Gaussian) sequences, obtained by banding. We prove a law of large numbers…
We consider Betti numbers of the excursion of a smooth Euclidean Gaussian field restricted to a rectangular window, in the asymptotics where the window grows to R^d . With motivations coming from Topological Data Analysis, we derive a…
We prove the existence of at least $cl(M)$ periodic orbits for certain time dependant Hamiltonian systems on the cotangent bundle of an arbitrary compact manifold $M$. These Hamiltonians are not necessarily convex but they satisfy a certain…
Simple argument in favour of unitarity, to all orders, of space-like noncommutative theory is given.
A sketch of our results on CPT and strings is given. A mechanism for spontaneous CPT violation in string theory is briefly reviewed, and recent theoretical progress is summarized. Possible CPT-violating contributions to a four-dimensional…
We formulate and prove a new sufficient conditions for Central Limit Theorem(CLT) in the space of continuous functions in the terms typical for the approximation theory. We prove that the conditions for continuous CLT obtained by N.C.Jain…
In the area of topological and geometric treatment of phase transitions and symmetry breaking in Hamiltonian systems, in a recent paper some general sufficient conditions for these phenomena in $\mathbb{Z}_2$-symmetric systems (i.e.…
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke…
We consider the determinantal point processes associated with the spectral projectors of a Schr\"odinger operator on $\mathbb{R}$, with a smooth confining potential. In the semiclassical limit, where the number of particles tends to…
We study monotone extension problems in the general framework of dual systems, without assuming separation. The paper develops a compact target-set formulation that includes multivalued operators as a special case and allows the initial set…
There has been some work in the literature on limit theorems for the trace of commutators for compact Lie groups. We revisit this from the perspective of combinatorial representation theory.
We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…
Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is…
Combining cross-section and time series data is a long and well established practice in empirical economics. We develop a central limit theory that explicitly accounts for possible dependence between the two data sets. We focus on common…
For Dynamical Systems, a strong bound on multiple correlations implies the Central Limit Theorem (CLT) [ChMa]. In Chernov's paper [Ch2], such a bound is derived for dynamically Holder continuous observables of dispersing Billiards. Here we…
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also…
In this paper we show the existence of strictly monotone heteroclinic type solutions of semilinear elliptic equations in cylinders. The motivation of this construction is twofold: first, it implies the existence of an entire bounded…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…
In this article choiceless polynomial time (CPT) is extended using non-determini\-stic Abstract State Machines (ASMs), which are restricted by three conditions: (1) choice is restricted to choice among atoms; (2) update sets in a state must…