Related papers: The LIL for canonical $U$-statistics
Suppose we observe an invertible linear process with independent mean-zero innovations and with coefficients depending on a finite-dimensional parameter, and we want to estimate the expectation of some function under the stationary…
We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…
Let $G$ be a real connected Lie group with a left invariant metric $d$, $\mathfrak{g}$ its Lie algebra. In this paper we present a set of interesting upper and lower bounds for $|d\exp_{x}(y)|,\ x,y \in \mathfrak{g}$. If $\textrm{ad}_x$ is…
In this note, we investigate the convergence of a $U$-statistic of order two having stationary ergodic data. We will find sufficient conditions for the almost sure and $L^1$ convergence and present some counter-examples showing that the…
We derive a novel framework called Bi-Directional Grid Constrained (BGC) stochastic processes in which the further an Ito diffusion drifts away from the origin, then the further it will be constrained. By making suitable modifications to…
In this paper it is demonstrated how rigorous numerics may be applied to the one-dimensional nonlinear Schr\"odinger equation (NLS); specifically, to determining bound--state solutions and establishing certain spectral properties of the…
We derive laws of the iterated logarithm for random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.
We offer new proofs, refinements as well as new results related to classical means of two variables, including the identric and logarithmic means.
We introduce LAM, a subsystem of IMALL2 with restricted additive rules able to manage duplication linearly, called linear additive rules. LAM is presented as the type assignment system for a calculus endowed with copy constructors, which…
Linear Logic refines Intuitionnistic Logic by taking into account the resources used during the proof and program computation. In the past decades, it has been extended to various frameworks. The most famous are indexed linear logics which…
Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…
We give a forbidden pattern characterization for the class of generalized definite languages, show that the corresponding problem is NL-complete and can be solved in quadratic time. We also show that their syntactic complexity coincides…
The article continues the study of the genus of regular languages that the authors introduced in a 2012 paper. Generalizing a previous result, we produce a new family of regular languages on a two-letter alphabet having arbitrary high…
The aim of this paper is to tackle part of the program set by Diekmann et al. in their seminal paper Diekmann et al. (2001). We quote "It remains to investigate whether, and in what sense, the nonlinear determin-istic model formulation is…
In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…
Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…
This paper presents a canonical dual approach for solving a nonlinear population growth problem governed by the well-known logistic equation. Using the finite difference and least squares methods, the nonlinear differential equation is…
Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…
We give an order-explicit large deviation bound for the difference between a high-dimensional $U$-statistic and its H\'{a}jek projection. In particular, we show that any $U$-statistic of order $b$ on $n$ observations, with a $d$-dimensional…
Canonical is a solver for type inhabitation in dependent type theory, that is, the problem of producing a term of a given type. We present a Lean tactic which invokes Canonical to generate proof terms and synthesize programs. The tactic…