Related papers: Speed of convergence for the realization of an eff…
In this article we study how a subshift can simulate another one, where the notion of simulation is given by operations on subshifts inspired by the dynamical systems theory (factor, projective subaction...). There exists a correspondence…
In this manuscript we study properties of multidimensional shifts. More precisely, we study the necessary and sufficient conditions for a shift to be sofic, i.e. the boundary between sofic shifts and effective ones. To this end, we use…
This article is concerned with the numerical solution of subspace optimization problems, consisting of minimizing a smooth functional over the set of orthogonal projectors of fixed rank. Such problems are encountered in particular in…
In this article we prove that multidimensional effective S-adic systems, obtained by applying an effective sequence of substitutions chosen among a finite set of substitutions, are sofic subshifts.
The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift $\Sigma$ can be described by a labelled graph $G$. Factorising $G$ in a suitable way we obtain the graph $G/_\approx$ that offers insight…
The study of subshifts on groups different from $\mathbb{Z}$, such as $\mathbb{Z}^d$, $d\geq 2$, has been a subject of intense research in recent years. These investigations have unveiled aremarkable connection between dynamics and…
Given an irrational vector $\alpha$ in $\mathbb{R}^{d}$, a continuous function $f(x)$ on the torus $\mathbb{T}^{d}$ and suitable weights $\Phi(N,n)$ such that $\sum_{n=-\infty}^{+\infty}\Phi(N,n)=1$, we estimate the speed of convergence to…
We study two-dimensional subshifts whose horizontal trace (a.k.a. projective subdynamics) contains only points of finite support. Our main result is a classification result for such subshifts satisfying a minimality property. As…
The subdivision graph $S(\Sigma)$ of a graph $\Sigma$ is obtained from $\Sigma$ by `adding a vertex' in the middle of every edge of $\Si$. Various symmetry properties of $\S(\Sigma)$ are studied. We prove that, for a connected graph…
Given a probability space $(X,\mu)$, a square integrable function $f$ on such space and a (unilateral or bilateral) shift operator $T$, we prove under suitable assumptions that the ergodic means $N^{-1}\sum_{n=0}^{N-1} T^nf$ converge…
For rescaled additive functionals of the sine-process, upper bounds are obtained for their speed of convergence to the Gaussian distribution with respect to the Kolmogorov-Smirnov metric. Under scaling with coefficient $R$ the…
We present a new finite-sample analysis of M-estimators of locations in $\mathbb{R}^d$ using the tool of the influence function. In particular, we show that the deviations of an M-estimator can be controlled thanks to its influence function…
Our main result improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect matching in a k-uniform hypergraph on n vertices. We also extend bounds of Bollobas, Daykin and Erdos by asymptotically determining the…
The main purpose of this paper is to strengthen our understanding of sofic mean dimension of two typical classes of sofic group actions. First, we study finite group actions. We prove that sofic mean dimension of any amenable group action…
Real-time time-dependent density functional theory (RT-TDDFT) is known to be hindered by the very small time step (attosecond or smaller) needed in the numerical simulation due to the fast oscillation of electron wavefunctions, which…
In this paper, we present two variants of DCA (Different of Convex functions Algorithm) to solve the constrained sum of differentiable function and composite functions minimization problem, with the aim of increasing the convergence speed…
With the emergence of graph databases, the task of frequent subgraph discovery has been extensively addressed. Although the proposed approaches in the literature have made this task feasible, the number of discovered frequent subgraphs is…
In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\mathbf{\hat{f}} \in \mathbb{C}^N$ of any given input vector…
Two-dimensional sigma models are defined for the new manifestly spacetime supersymmetric description of four-dimensional compactified superstrings. The resulting target-superspace effective action is constrained by the way the spacetime…
We analyze the constant step size subgradient method on nonsmooth, nonconvex functions. We identify geometric assumptions on the objective function under which i) its domain admits a partition (stratification) into smooth manifolds (strata)…