Related papers: Fonction complexit\'e associ\'ee \`a une applicati…

We study the radius of absolute monotonicity R of rational functions with numerator and denominator of degree s that approximate the exponential function to order p. Such functions arise in the application of implicit s-stage, order p…

$f$-electron systems exhibit a subtle interplay between strong spin--orbit coupling and crystal-field effects, producing complex energy landscapes that are computationally demanding. We introduce auxiliary functions, constructed by…

For a Schwartz function $f$ on the plane and a non-zero $v\in\ZR^2$ define the Hilbert transform of $f$ in the direction $v$ to be $$ H_vf(x)=\text{p.v.}\int_\ZR f(x-vy) \frac{dy}y $$ Let $\zeta$ be a Schwartz function with frequency…

Planar spin-transfer devices with dominating easy-plane anisotropy can be described by an effective one-dimensional equation for the in-plane angle. Such a description provides an intuitive qualitative understanding of the magnetic…

We develop a class of algebraic interpretations for many-sorted and higher-order term rewriting systems that takes type information into account. Specifically, base-type terms are mapped to \emph{tuples} of natural numbers and higher-order…

The symbolic complexity of an infinite word $W$ is the function $p_W(l)$ counting the number of different subwords in $W$ of length $l$. In this paper our main purpose is to study the complexity for a class of topological dynamical systems,…

This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$,…

We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the…

Relative to the large literature on upper bounds on complexity of convex optimization, lesser attention has been paid to the fundamental hardness of these problems. Given the extensive use of convex optimization in machine learning and…

We analyze several problems of Optimal Transport Theory in the setting of Ergodic Theory. In a certain class of problems we consider questions in Ergodic Transport which are generalizations of the ones in Ergodic Optimization. Another class…

We find the necessary and sufficient conditions on the Fourier coefficients of a function $g$ on the torus to be in the range of the $X$-ray transform of a symmetric tensor of compact support in the plane.

Several large-scale machine learning tasks, such as data summarization, can be approached by maximizing functions that satisfy submodularity. These optimization problems often involve complex side constraints, imposed by the underlying…

Using results relating the complexity of a two dimensional subshift to its periodicity, we obtain an application to the well-known conjecture of Furstenberg on a Borel probability measure on $[0,1)$ which is invariant under both $x\mapsto…

Here we present an ergodic theorem which adapts a Theorem by J. Elton to the classical thermodynamical formalism and to ergodic transport. First, we discuss how Elton's theorem can be used to characterise Gibbs measures for expanding maps.…

The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…

For the Tornheim double zeta function T(s1,s2,s3) of complex variables,we obtain its functional equations,which are new.Using the calculus of r-th order derivative of zeta(s,alpha) as a function of alpha(developed in author[7])as the…

The function $ \tan(\pi x / 2) / (\pi x / 2) $ is expanded into a Laurent series of $ 1 - x^2 $, where the coefficients are given explicitly as combinations of zeta function of even integers. This is used to achieve a sequence of upper and…

A large class of spin transfer oscillators use the free layer with a strong easy plane anisotropy, which forces its magnetization to move close to the plane. We show that in this situation the effective planar approximation provides a fast…

Regularising the primal formulation of optimal transport (OT) with a strictly convex term leads to enhanced numerical complexity and a denser transport plan. Many formulations impose a global constraint on the transport plan, for instance…

The goal of this paper is twofold. Firstly, we provide a type-uniform formula for the torus complexity of the usual torus action on a Richardson variety, by developing the notion of algebraic dimensions of Bruhat intervals, strengthening a…