Related papers: On the upper bound in Varadhan's Lemma
The main aim of the paper is to prove a fountain theorem without assuming the $\tau$-upper semicontinuity condition on the variational functional. Using this improved fountain theorem, we may deal with more general strongly indefinite…
We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…
Assuming the Generalized Riemann Hypothesis, we provide uniform upper and lower bounds with explicit main terms for $\log{\left|\cL(s)\right|}$ for $\sigma \in (1/2,1)$ and for functions in the Selberg class. In particular, we focus on the…
In a previous paper we developed a regularity and compactness theory in Euclidean ambient spaces for codimension 1 weakly stable CMC integral varifolds satisfying two (necessary) structural conditions. Here we generalize this theory to the…
Classical results of second order parabolic quasi-linear equations always require that the nonlinear terms are controlled by a power of the unknown functions and their first derivatives. We improve the previous results. More precisely, in…
The regularity lemma is a stringent condition of the possible ranks of tensor blow-ups of linear subspaces of matrices. It was proved by Ivanyos, Qiao and Subrahmanyam when the underlying field is sufficiently large. We show that if the…
We propose a unifying general framework of quantitative primal and dual sufficient and necessary error bound conditions covering linear and nonlinear, local and global settings. The function is not assumed to possess any particular…
We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let mvd(F) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of…
Submodular functions are known to satisfy various forms of fractional subadditivity. This work investigates the conditions for equality to hold exactly or approximately in the fractional subadditivity of submodular functions. We establish…
The decision tree is a flexible machine learning model that finds its success in numerous applications. It is usually fitted in a recursively greedy manner using CART. In this paper, we investigate the convergence rate of CART under a…
This paper relates the lower semi-continuity of an integral functional in the compensated compactness setting of vector fields satisfying a constant-rank first-order differential constraint, to closed $\mathcal{A}$-$p$ quasiconvexity of the…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
We give a number of results about families of Ulam sets. Generalizing behavior of Ulam sets U(1,n), we prove using an novel model theoretic approach that there is a rigidity phenomenon for Ulam sets U(a,b) as b increases. Based on this, we…
The best known constant in Uchiyama's Lemma is $e$. A conjecture states that this cannot be improved. We show that the constant $e$ also stands in a dyadic version of Uchiyama's Lemma. Further, we prove that in the dyadic case, the constant…
We derive the Euler-Lagrange equations for minimizers of causal variational principles in the non-compact setting with constraints, possibly prescribing symmetries. Considering first variations, we show that the minimizing measure is…
The ordinary continued fractions expansion of a real number is based on the Euclidean division. Variants of the latter yield variants of the former, all encompassed by a more general Dynamical Systems framework. For all these variants the…
We prove Mermin-Wagner-type theorems for quantum lattice systems in the presence of multipole symmetries. These theorems show that the presence of higher-order symmetries protects against the breaking of lower-order ones. In particular, we…
We prove two lower bounds for stopping times of sequential tests between general composite nulls and alternatives. The first lower bound is for the setting where the type-1 error level $\alpha$ approaches zero, and equals $\log(1/\alpha)$…
Given a cardinal $\kappa$ that is $\lambda$-supercompact for some regular cardinal $\lambda\geq\kappa$ and assuming $\GCH$, we show that one can force the continuum function to agree with any function $F:[\kappa,\lambda]\cap\REG\to\CARD$…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…