Related papers: Minoration of the complexity function associated t…
We consider rotations on the torus $\mathbb{T}^2$, and we classify them with respect to the complexity functions. In dimension one, a minimal rotation can be coded by a sturmian word. A sturmian word has complexity $n+1$ by the…
In this paper, we introduce a generalized piecewise translation map on the Euclidean space. We provide a special case when this map is always of finite type. For a finite type map in this case, we form conjectures on the semi-continuity of…
In this article we give the optimal lower bound for the complexity function of a planar translation which induces an ergodic rotation of the torus $\mathbb{R}^2 / \mathbb{Z}^2$. In addition, we give an explicit calculation of this…
The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most $n$, is $2^{n+O(1)}$. If we replace "everywhere" by "for all sufficiently large inputs", the…
Given a probability measure $\mu$ on the $n-$torus $T^n$ and a rotation vector $k\in R^n$, we ask wether there exists a minimizer to the integral $\int_{T^n} |\grad\phi+k|^2 d\mu$. This problem leads, naturally, to a class of elliptic PDE…
In this paper, we prove that almost every translation of $\mathbb{T}^2$ admits a symbolic coding which has linear complexity $2n+1$. The partitions are constructed with Rauzy fractals associated with sequences of substitutions, which are…
The piecewise complexity $h(u)$ of a word is the minimal length of subwords needed to exactly characterise $u$. Its piecewise minimality index $\rho(u)$ is the smallest length $k$ such that $u$ is minimal among its order-$k$ class $[u]_k$…
The piecewise complexity $h(u)$ of a word is the minimal length of subwords needed to exactly characterise $u$. Its piecewise minimality index $\rho(u)$ is the smallest length $k$ such that $u$ is minimal among its order-$k$ class $[u]_k$…
We consider the algorithm for verified integration of piecewise analytic functions given by Petras. The analysis of the algorithm contained in Patras' paper is limited to a narrow class of functions and gives upper bounds only. We present…
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.
In this paper we study a max-min $k$-partition problem on a weighted graph, that could model a robust $k$-coalition formation. We settle the computational complexity of this problem as complete for class $\Sigma_2^P$. This hardness holds…
The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…
We evaluate one-point correlation numbers on the torus in the Liouville theory coupled to the conformal matter M(2,2p+1). We find agreement with the recent results obtained in the matrix model approach.
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.
The goal of this note is to show that continuous functions may be approximated using scattered translates of the Poisson kernel.
We consider a minimal action of a finitely generated semigroup by homeomorphisms of a circle, and show that the collection of translation numbers of individual elements completely determines the set of generators (up to a common continuous…
For positive integers $n\ge s> r$, the Tur\'an function $T(n,s,r)$ is the smallest size of an r-graph with n vertices such that every set of s vertices contains at least one edge. Also, define the Tur\'an density $t(s,r)$ as the limit of…
We consider the minimization problem of a sum of a number of functions having Lipshitz $p$-th order derivatives with different Lipschitz constants. In this case, to accelerate optimization, we propose a general framework allowing to obtain…
A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…
We compute the extremal plurisubharmonic function of the real torus viewed as a compact subset of its natural algebraic complexification.