Related papers: A simple proof for monotone CLT
We study a node-wise monotone barrier coupling law, motivated by the synaptic coupling of neural central pattern generators. It is illustrated that this coupling imitates the desirable properties of neural central pattern generators. In…
This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…
We extend discrete Morse-Bott theory to the setting of loop-free (or acyclic) categories. First of all, we state a homological version of Quillen's Theorem A in this context and introduce the notion of cellular categories. Second, we…
We solve the monomer-dimer problem on a non-bipartite lattice, the simple quartic lattice with cylindrical boundary conditions, with a single monomer residing on the boundary. Due to the non-bipartite nature of the lattice, the well-known…
Since the introduction by Hodges, and refinement by V\"a\"an\"anen, team semantic constructions have been used to generate expressively enriched logics still conserving nice properties, such as compactness or decidability. In contrast,…
We obtain a Central Limit Theorem for closed Riemannian manifolds, clarifying along the way the geometric meaning of some of the hypotheses in Bhattacharya and Lin's Omnibus Central Limit Theorem for Fr\'echet means. We obtain our CLT…
Despite the long-recognized fact that chemical structure and specific interactions greatly influence the thermodynamic properties of polymer systems, a predictive molecular theory that enables systematically addressing the role of chemical…
We give in this short report a very simple proof of Zero-One Law for the stable distributions in Linear Topological Spaces (LTS).
We provide the first quantitative estimates for the rate of convergence in the free multiplicative central limit theorem (CLT), in terms of the Kolmogorov and $r$-Wasserstein distances for $r \geq 1$. While the free additive CLT has been…
Congruence closure procedures are used extensively in automated reasoning and are a core component of most satisfiability modulo theories solvers. However, no known congruence closure algorithms can support any of the expressive logics…
A dual-core waveguide with balanced gain and loss in different arms and with intermodal coupling is considered. The system is not invariant under the conventional $PT$ symmetry but obeys $CPT$ symmetry where an additional spatial inversion…
In this paper we establish a general dynamical Central Limit Theorem (CLT) for group actions which are exponentially mixing of all orders. In particular, the main result applies to Cartan flows on finite-volume quotients of simple Lie…
Apparent violations of CPT and Lorentz symmetry might arise in nature as a result of spontaneous symmetry breaking in a theory beyond the standard model. This talk summarizes a few relevant theoretical and experimental issues, with some…
This paper examines linear independence of shearlet systems. This property has already been studied for wavelets and other systems such as, for instance, for Gabor systems. In fact, for Gabor systems this problem is commonly known as the…
This paper focuses on succinctness results for fragments of Linear Temporal Logic with Past (LTL) devoid of binary temporal operators like until, and provides methods to establish them. We prove that there is a family of cosafety languages…
We consider N single server infinite buffer queues with service rate \beta. Customers arrive at rate N\alpha, choose L queues uniformly, and join the shortest. We study the processes R^N for large N, where R^N_t(k) is the fraction of queues…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
In this paper we provide an asymptotic theory for the symmetric version of the Kullback--Leibler (KL) divergence. We define a estimator for this divergence and study its asymptotic properties. In particular, we prove Law of Large Numbers…
A key concern in modern distributed systems is to avoid the cost of coordination while maintaining consistent semantics. Until recently, there was no answer to the question of when coordination is actually required. In this paper we present…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…