Related papers: Log-convex sequences and nonzero proximate orders

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

We study a generalized framework for structured sparsity. It extends the well-known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as part of a convex optimization problem. This framework provides…

This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonoff's universal prior M, the latter being an excellent…

We introduce a concept of a quasi proximate order which is a generalization of a proximate order and allows us to study efficiently analytic functions whose order and lower order of growth are different. We prove an existence theorem of a…

The categories with noninvertible morphisms are studied analogously to the semisupermanifolds with noninvertible transition functions. The concepts of regular n-cycles, obstruction and the regularization procedure are introduced and…

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

We define a congruence module $\Psi_A(M)$ associated to a surjective $\mathcal O$-algebra morphism $\lambda\colon A \to \mathcal{O}$, with $\mathcal{O}$ a discrete valuation ring, $A$ a complete noetherian local $\mathcal{O}$-algebra…

Metric regularity is among the central concepts of nonlinear and variational analysis, constrained optimization, and their numerous applications. However, metric regularity can be elusive for some important ill-posed classes of problems…

A sequence $\{z_n\}_{n\geq0}$ is called ratio log-convex in the sense that the ratio sequence $\{\frac{z_{n+1}}{z_n}\}_{n\geq0}$ is log-convex. Based on a three-term recurrence for sequences, we develop techniques for dealing with the ratio…

Summation methods play a very important role in quantum field theory because all perturbation series are divergent and the expansion parameter is not always small. A number of methods have been tried in this context, most notably Pade…

We study classes of modules closed under direct sums, $\mathcal{M}$-submodules and $\mathcal{M}$-epimorphic images where $\mathcal{M}$ is either the class of embeddings, $RD$-embeddings or pure embeddings. We show that the…

Flexible sparsity regularization means stably approximating sparse solutions of operator equations by using coefficient-dependent penalizations. We propose and analyse a general nonconvex approach in this respect, from both theoretical and…

We study polynomials interpolating the (rational) constant terms of certain meromorphic modular forms for Hecke groups. We make observations about the divisibility properties of the constant terms and connect them to several sequences, for…

In the course of many mathematical developments involving 'number systems' like $\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb {C}$ etc., it sometimes becomes necessary to abstract away and study certain properties of the number…

In a nutshell, submodular functions encode an intuitive notion of diminishing returns. As a result, submodularity appears in many important machine learning tasks such as feature selection and data summarization. Although there has been a…

The investigation of regularity/summability properties of the coefficients of bilinear forms in sequence spaces was initiated by Littlewood in $1930$. Nowadays, this topic has important connections with other fields of Pure and Applied…

In this paper, we propose a multilevel stochastic framework for the solution of nonconvex unconstrained optimization problems. The proposed approach uses random regularized first-order models that exploit an available hierarchical…

We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…

In continuous logic, there are plenty of examples of interesting stable metric structures. However, on the other side of the SOP line, there are only a few metric structures where order is relevant, and orders often appear in different…

For any $p\in[1,\infty]$, we prove that the set of simple functions taking at most $k$ different values is proximinal in $L^p$ for all $k\geq 1$. We introduce the class of uniformly approximable subsets of $L^p$, which is larger than the…