Related papers: On partial rigidity of $\mathcal{S}$-adic subshift…
In the first part of this paper, we establish a conditional optimality result for an adaptive mixed finite element method for the stationary Stokes problem discretized by the standard Taylor-Hood elements, under the assumption of the…
We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…
Consider the approximation of stochastic Allen-Cahn-type equations (i.e. $1+1$-dimensional space-time white noise-driven stochastic PDEs with polynomial nonlinearities $F$ such that $F(\pm \infty)=\mp \infty$) by a fully discrete space-time…
In this article, we introduce the fractional maximal operator on the Hyperbolic space, a non-doubling measure space, and study the weighted boundedness. Motivated in the weighted boundedness of Hardy-Littlewood maximal studied by Antezana…
The {\it number rigidity} of a stationary point process $\mathsf{P}$ entails that for a bounded set $A$ the knowledge of $\mathsf{P}$ on $A^{c}$ a.s. determines $\mathsf{P}(A)$; the $k$-order rigidity means the moments of $\mathsf{P}1_{A}$…
In the submodular cover problem, we are given a non-negative monotone submodular function $f$ over a ground set $E$ of items, and the goal is to choose a smallest subset $S \subseteq E$ such that $f(S) = Q$ where $Q = f(E)$. In the…
We suggest two versions of the Hardy--Littlewood--Sobolev inequality for discrete time martingales. In one version, the fractional integration operator is a martingale transform, however, it may vanish if the filtration is excessively…
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi, constructs a non trivial set S minimizing d(S,V-S). This includes the possibility for the…
Fractures are normally present in the underground and are, for some physical processes, of paramount importance. Their accurate description is fundamental to obtain reliable numerical outcomes useful, e.g., for energy management. Depending…
We consider mechanics of composite materials in which thin inclusions are modeled by lower-dimensional manifolds. By successively applying the dimensional reduction to junctions and intersections within the material, a geometry of…
Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…
This paper is devoted to developing the alternating minimization algorithm for problems of structured nonconvex optimization proposed by Attouch, Bolt\'e, Redont, and Soubeyran in 2010. Our main result provides significant improvements of…
We suggest a new mean field method for studying the thermodynamic competition between magnetic and superconducting phases in a two-dimensional square lattice. A partition function is constructed by writing microscopic interactions that…
Two criteria for the robust quasiconvexity of lower semicontinuous functions are established in terms of Fr\'echet subdifferentials in Asplund spaces.
Under weaker regularity and compactness assumptions, we find the mountain-pass essential point, which is a novel extension of the classical Ambrosetti-Rabinowitz mountain pass theorem. We study the reversible superquadratic autonomous…
We give an upper bound for the error term in the Hardy-Ramanujan-Rademacher formula for the partition function. The main input is a new hybrid subconvexity bound for the central value $L(\tfrac 12,f\times (\tfrac{q}{\cdot}))$ in the $q$ and…
We present a semiclassical trace formula for the canonical partition function of arbitrary one-dimensional systems. The approximation is obtained via the stationary exponent method applied to the phase-space integration of the density…
We consider word complexity and topological entropy for random substitution subshifts. In contrast to previous work, we do not assume that the underlying random substitution is compatible. We show that the subshift of a primitive random…
We propose a methodology for studying the performance of common splitting methods through semidefinite programming. We prove tightness of the methodology and demonstrate its value by presenting two applications of it. First, we use the…
We study, the Regularity of the Timoshenko system with two fractional dampings $(-\Delta)^\tau u_t$ and $(-\Delta)^\sigma \psi_t$; both of the parameters $(\tau, \sigma)$ vary in the interval $[0,1]$. We note that ($\tau=0$ or $\sigma=0$)…