Related papers: Fonction complexit\'e associ\'ee \`a une applicati…
Up until now, it was recognized that a large number of 2-torsion points was a technical barrier to improve the bounds for the symmetric tensor rank of multiplication in every extension of any finite field. In this paper, we show that there…
We calculate a certain mean-value of meromorphic functions by using specific ergodic transformations, which we call affine Boolean transformations. We use Birkhoff's ergodic theorem to transform the mean-value into a computable integral…
We give a proof of the convergence of an algorithm for the construction of lower dimensional elliptic tori in nearly integrable Hamiltonian systems. The existence of such invariant tori is proved by leading the Hamiltonian to a suitable…
We consider the $(\ell_p,\ell_r)$-Grothendieck problem, which seeks to maximize the bilinear form $y^T A x$ for an input matrix $A$ over vectors $x,y$ with $\|x\|_p=\|y\|_r=1$. The problem is equivalent to computing the $p \to r^*$ operator…
We perform a bivariate Taylor expansion of the axisymmetric Green function in order to determine the exterior potential of a static thin toroidal shell having a circular section, as given by the Laplace equation. This expansion, performed…
Let $(X, \mathcal{A},\mu)$ be a probability space and let $T$ be a contraction on $L^2(\mu)$. We provide suitable conditions over sequences $(w_k)$, $(u_k)$ and $(A_k)$ in such a way that the weighted ergodic limit…
This article is a survey of a series of papers [FOOO3,FOOO4,FOOO5] in which we developed the method of calculation of Floer cohomology of Lagrangian torus orbits in compact toric manifolds, and its applications to symplectic topology and to…
We study the topological complexity of work maps with respect to some subspaces of the configuration space and a workspace considered as the target set of the motion of robots. The motivation is to optimize and reduce the number of motion…
We introduce the effectual topological complexity (ETC) of a $G$-space $X$. This is a $G$-equivariant homotopy invariant sitting in between the effective topological complexity of the pair $(X,G)$ and the (regular) topological complexity of…
We consider the numerical solution of the discrete multi-marginal optimal transport (MOT) by means of the Sinkhorn algorithm. In general, the Sinkhorn algorithm suffers from the curse of dimensionality with respect to the number of…
This remark describes efficiency improvements to Algorithm 916 [Zaghloul and Ali 2011]. It is shown that the execution time required by the algorithm, when run at its highest accuracy, may be improved by more than a factor of two. A better…
We set up a parametrised monadic translation for a class of call-by-value functional languages, and prove a corresponding soundness theorem. We then present a series of concrete instantiations of our translation, demonstrating that a number…
The arithmetic complexity counts the number of algebraically independent entries in the periodic continued fraction $\theta=[b_1,\dots, b_N, \overline{a_1,\dots,a_k}]$. If $\mathscr{A}_{\theta}$ is a noncommutative torus corresponding to…
If $f$ is a meromorphic function from the complex plane ${\mathbb C}$ to the extended complex plane $\overline{ {\mathbb C} }$, for $r > 0$ let $n(r)$ be the maximum number of solutions in $\{z\colon |z| \leq r \}$ of $f(z) = a$ for $a \in…
We address an optimal reachability problem for a planar manipulator in a constrained environment. After introducing the optmization problem in full generality, we practically embed the geometry of the workspace in the problem, by…
The problem of maximizing a constrained monotone set function has many practical applications and generalizes many combinatorial problems. Unfortunately, it is generally not possible to maximize a monotone set function up to an acceptable…
We study very smooth functions on the real line, namely Schwartz functions, that satisfy a finite identity relating their translates and a single modulation. Concretely, we assume there is a nontrivial linear combination of translates of…
Entropic optimal transport (EOT) presents an effective and computationally viable alternative to unregularized optimal transport (OT), offering diverse applications for large-scale data analysis. In this work, we derive novel statistical…
We propose novel smooth approximations to the classical rounding function, suitable for differentiable optimization and machine learning applications. Our constructions are based on two approaches: (1) localized sigmoid window functions…
We extend Stein's maximal theorem to the bilinear setting. Let $M$ be a homogeneous space with a transitive action of a compact abelian group, and let $1 \le p,q \le 2$ and $1/2 \le r \le 1$ satisfy $1/p + 1/q = 1/r$. For a family of…