arXiv Math @arxiv_math@qoto.org

We introduce a novel time-varying step-size for the classical projected subgradient method, offering optimal ergodic convergence. Importantly, this approach does not depend on the Lipschitz assumption of the objective function, thereby broadening the convergence result of projected subgradient method to non-Lipschitz case.

In this paper, we improve, complement and generalize (from Nör\-lund to matrix transform means) a result of Móricz and Siddiqi \cite{MS} and some statements of Areshidze and Tephnadze \cite{AT}, and (from $T$ (weighted) to matrix transform means) Anakidze, Areshidze, Persson and Tephnadze \cite{AAPT}.

We present two integral representations of the logarithm of the Glaisher-Kinkelin constant. The calculations are based on definite integral expressions of $\logΓ(x)$, $Γ$ being the usual Gamma function, due respectively to Féaux and Kummer. The connection between the second formula and an infinite series expansion of the Glaisher-Kinkelin constant is also outlined.

Averaging dynamics drives countless processes in physics, biology, engineering, and the social sciences. In recent years, the $s$-energy has emerged as a useful tool for bounding the convergence rates of time-varying averaging systems. We derive new bounds on the $s$-energy, which we use to resolve a number of open questions in the areas of bird flocking, opinion dynamics, and distributed motion coordination. We also use our results to provide a theoretical validation for the idea of the "Overton Window" as an attracting manifold of viable group opinions. Our new bounds on the $s$-energy highlight its dependency on the connectivity of the underlying networks. In this vein, we use the $s$-energy to explain the exponential gap in the convergence rates of stationary and time-varying consensus systems.

We apply a seemingly forgotten series expression of Nörlund for the psi function to express infinite series involving inverse factorials in closed form. Many of such series contain products of Catalan numbers and (odd) harmonic numbers. We also prove some new series for $π$.

In this paper, we study the induced homological sequence and the induced merge tree of a discrete Morse function on a tree. A discrete Morse function on a tree gives rise to a sequence of Betti numbers that keep track of the number of components at each critical value. A discrete Morse function on a tree also gives rise to an induced merge tree which keeps track of component birth, death, and merging information. These topological indicators are similar but neither one contains the information of the other. We show that given a merge tree and a homological sequence along with some mild conditions on their relationship, there is a discrete Morse function on a tree that induces both the given merge tree and the given homological sequence.

Although algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified through ternary operations. In this context, we introduce structures that contain two constants and a ternary operation. We demonstrate that these structures are isomorphic to various significant algebraic systems, including Boolean algebras, de Morgan algebras, MV-algebras, and (near) rings of characteristic two. Our work highlights the versatility of ternary operations in describing and connecting diverse algebraic structures.

This article first introduces the concept of a general pseudo-homogeneous triangular norm. It then gives some properties of general pseudo-homogeneous triangular norms. Finally, it characterizes all general pseudo-homogeneous triangular norms completely.

This paper investigates, without any regularization procedure, the sensitivity analysis of a mechanical friction problem involving the (nonsmooth) Tresca friction law in the linear elastic model. To this aim a recent methodology based on advanced tools from convex and variational analyses is used. Precisely we express the solution to the so-called Tresca friction problem thanks to the proximal operator associated with the corresponding Tresca friction functional. Then, using an extended version of twice epi-differentiability, we prove the differentiability of the solution to the parameterized Tresca friction problem, characterizing its derivative as the solution to a boundary value problem involving tangential Signorini's unilateral conditions. Finally our result is used to investigate and numerically solve an optimal control problem associated with the Tresca friction model.

This paper focuses on the problem of minimizing a finite-sum loss $ \frac{1}{N}$ $ \sum_{ξ=1}^N f (\mathbf{x}; ξ) $, where only function evaluations of $ f (\cdot; ξ) $ is allowed. For a fixed $ ξ$, which represents a (batch of) training data, the Hessian matrix $ \nabla^2 f (\mathbf{x}; ξ) $ is usually low-rank. We develop a stochastic zeroth-order cubic Newton method for such problems, and prove its efficiency. More specifically, we show that when $ \nabla^2 f (\mathbf{x}; ξ) \in \mathbb{R}^{n\times n } $ is of rank-$r$, $ \mathcal{O}\left(\frac{n}{η^{\frac{7}{2}}}\right)+\widetilde{\mathcal{O}}\left(\frac{n^2 r^2 }{η^{\frac{5}{2}}}\right) $ function evaluations guarantee a second order $η$-stationary point with high probability. This result improves the dependence on dimensionality compared to the existing state-of-the-art. This improvement is achieved via a new Hessian estimation method, which can be efficiently computed by finite-difference operations, and does not require any incoherence assumptions. Numerical experiments are provided to demonstrate the effectiveness of our algorithm.

Recent advances in bipartite consensus on matrix-weighted networks, where agents are divided into two disjoint sets with those in the same set agreeing on a certain value and those in different sets converging to opposite values, have highlighted its potential applications across various fields. Traditional approaches often depend on the existence of a positive-negative spanning tree in matrix-weighted networks to achieve bipartite consensus, which greatly restricts the use of these approaches in engineering applications. This study relaxes that assumption by allowing weak connectivity within the network, where paths can be weighted by semidefinite matrices. By analyzing the algebraic constraints imposed by positive-negative trees and semidefinite paths, we derive new sufficient conditions for achieving bipartite consensus. Our findings are validated by numerical simulations.

This paper develops and analyzes a class of semi-discrete and fully discrete weak Galerkin finite element methods for unsteady incompressible convective Brinkman-Forchheimer equations. For the spatial discretization, the methods adopt the piecewise polynomials of degrees $m\ (m\geq1)$ and $m-1$ respectively to approximate the velocity and pressure inside the elements, and piecewise polynomials of degree $m$ to approximate their numerical traces on the interfaces of elements. In the fully discrete method, the backward Euler difference scheme is used to approximate the time derivative. The methods are shown to yield globally divergence-free velocity approximation. Optimal a priori error estimates in the energy norm and $L^2$ norm are established. A convergent linearized iterative algorithm is designed for solving the fully discrete system. Numerical experiments are provided to verify the theoretical results.

Friends-and-strangers graphs, coined by Defant and Kravitz, are denoted by $\mathsf{FS}(X,Y)$ where $X$ and $Y$ are both graphs on $n$ vertices. The graph $X$ represents positions and edges mark adjacent positions while the graph $Y$ represents people and edges mark friendships. The vertex set of $\mathsf{FS}(X,Y)$ consists of all one-to-one placements of people on positions, and there is an edge between any two placements if it is possible to swap two people who are friends and on adjacent positions to get from one placement to the other. Previous papers have studied when $\mathsf{FS}(X,Y)$ is connected. In this paper, we consider when $\mathsf{FS}(X,Y)$ is $k$-connected where a graph is $k$-connected if it remains connected after removing any $k-1$ or less vertices. We first consider $\mathsf{FS}(X,Y)$ when $Y$ is a complete graph or star graph. We find tight bounds on their connectivity, proving their connectivity equals their minimum degree. We further consider the size of the connected components of $\mathsf{FS}(X,\mathsf{Star}_n)$ where $X$ is connected. We show that asymptotically similar conditions as the conditions mentioned by Bangachev are sufficient for $\mathsf{FS}(X,Y)$ to be $k$-connected. Finally, we consider when $X$ and $Y$ are independent Erdős--Rényi random graphs on $n$ vertices and edge probability $p_1$ and $p_2,$ respectively. We show that for $p_0 = n^{-1/2+o(1)},$ if $p_1p_2\geq p_0^2$ and $p_1,$ $p_2 \geq w(n) p_0$ where $w(n) \rightarrow 0$ as $n \rightarrow \infty,$ then $\mathsf{FS}(X,Y)$ is $k$-connected with high probability. This is asymptotically tight as we show that below an asymptotically similar threshold $p_0'=n^{-1/2+o(1)}$, the graph $\mathsf{FS}(X,Y)$ is disconnected with high probability if $p_1p_2 \leq (p_0')^2$.

We extend to the $n$-dimensional ellipsoid contained in $\R^{n+1},$ the Darboux theory of integrability for polynomial vector fields in the $n$-dimensional sphere (Llibre et al., 2018). New results on the maximum number of invariant parallels and meridians of polynomial vector fields $\X$ on the invariant $n-$dimensional ellipsoid, as a function of its degree, are provided. Our results extend the known result on the upper bound for the number of invariant hyperplanes that a polynomial vector field $\Y$ in $\R^n$ can have in function of the degree of $\Y$.

In this paper, we provide different splitting methods for solving distributionally robust optimization problems in cases where the uncertainties are described by discrete distributions. The first method involves computing the proximity operator of the supremum function that appears in the optimization problem. The second method solves an equivalent monotone inclusion formulation derived from the first-order optimality conditions, where the resolvents of the monotone operators involved in the inclusion are computable. The proposed methods are applied to solve the Couette inverse problem with uncertainty and the denoising problem with uncertainty. We present numerical results to compare the efficiency of the algorithms.

We prove vanishing results for Witten genera of string generalized complete intersections in homogeneous $\text{Spin}^c$-manifolds and in other $\text{Spin}^c$-manifolds with Lie group actions. By applying these results to Fano manifolds with second Betti number equal to one we get new evidence for a conjecture of Stolz.

For a closed negatively monotone symplectic manifold, we construct quasi-isometric embeddings from the Euclidean spaces to its Hamiltonian diffeomorphism group, assuming it contains an incompressible heavy Lagrangian. We also show the super-heaviness of its skeleton with respect to a Donaldson hypersurface.

A cryptarithm (or alphametic) is a mathematical puzzle in which numbers are represented with words in such a way that identical letters stand for equal digits and distinct letters for unequal digits. An alphametic puzzle is usually given in the form of an equation that needs to be solved, such as SEND + MORE = MONEY. Alternatively, here we will consider cryptarithms constrained not by an equation but by a particular subsequence of natural numbers, for example perfect squares or primes. Such a cryptarithm has a unique solution if there is exactly one term in the sequence that has the corresponding pattern of digits. We will call such terms cryptarithmically unique. Here we estimate the density of such terms in an arbitrary sequence for which the overall density of terms among integers is known. In particular, among all perfect squares below 10^12, slightly less than one half are cryptarithmically unique, their density increasing toward larger numbers. Cryptarithmically unique prime numbers, however, are initially very scarce. Combinatorial estimates suggest that their density should drop below 10^-300 for decimal lengths of approximately 1829 digits, but then it recovers and is asymptotic to unity for very large primes. Finally, we introduce and discuss primonumerophobic digit patterns that no prime number happens to have.

We prove that the rational cohomology ring of moduli space of multiscale differentials in genus 0 is generated by the boundary divisors. The main idea is the technique of the Chow-Künneth generation Property and the observation that the intersection of a collection of boundary divisors in the moduli space is irreducible. We observe that the relations between the boundary strata in cohomology are generated by the pullback of the WDVV relations and the relations between the torus-invariant subvarieties in the fiber over $\overline{M}_{0,n}$. We also characterize the cases in which the moduli space is a smooth variety, and in these cases, we prove that the integral cohomology ring is generated by the boundary divisors.

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chvtal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was conjectured in 2018 by Aboulker et al. that any large enough bridgeless graph on n vertices defines a metric space that has at least n lines. We study the natural extension of Aboulker et al.'s conjecture into the context of quasi-metric spaces defined by digraphs of low diameter. We prove that it is valid for quasi-metric spaces defined by bipartite digraphs of diameter at most three, oriented graphs of diameter two and, digraphs of diameter three and directed girth four.