Related papers: On Effective Convergence in Fekete's Lemma and Rel…
A classical result of Fekete gives necessary conditions on a compact set in the complex plane so that it contains infinitely many sets of conjugate algebraic integers. For such sets, we demonstrate the existence of a sequence of algebraic…
We prove an analogue of Fekete's subadditivity lemma for functions of several real variables which are subadditive in each variable taken singularly. This extends both the classical case for subadditive functions of one real variable, and a…
Fekete's lemma shows the existence of limits in subadditive sequences. This lemma, and generalisations of it, also have been used to prove the existence of thermodynamic limits in statistical mechanics. In this paper it is shown that the…
In this paper, we present an alternative proof of Fekete's Lemma. We demonstrate that for any subadditive sequence, it is possible to construct a subadditive function that exactly interpolates the sequence. Using this result, along with…
For a sequence of vectors $\{v_n\}_{n\in\mathbb{N}}$ in the uniformly convex Banach space $X$ which for all $n, m\in \mathbb{N}$ satisfy $\|v_{n+m}\|\le \|v_n + v_m\|$ we show the existence of the limit $\lim_{n\to \infty} \frac{v_n}{n}$.…
We give an extension of the Fekete's Subadditive Lemma for a set of submultiplicative functionals on countable product of compact spaces. Our method can be considered as an unfolding of the ideas [1]Theorem 3.1 and our main result is an…
We demonstrate that techniques of Weihrauch complexity can be used to get easy and elegant proofs of known and new results on initial value problems. Our main result is that solving continuous initial value problems is Weihrauch equivalent…
We prove an analogue of Fekete's lemma for subadditive right-subinvariant functions defined on the finite subsets of a cancellative left-amenable semigroup. This extends results previously obtained in the case of amenable groups by E.…
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…
Given a compact subset $\Sigma \subset \mathbb{R}$ (or $\mathbb{C}$) with logarithmic capacity greater than zero, we construct an explicit family of probability measures supported on $\Sigma$ such that their closure is all the possible weak…
We consider again a classical theorem relating capacities and algebraic integers and the question of the simultaneous approximation of $ n-1$ different complex numbers by conjugate algebraic integers of degree $n$.
We survey what is known about Fekete points/optimal designs for a simplex in $\R^d.$ Several new results are included. The notion of Fej\'er exponenet for a set of interpolation points is introduced.
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…
Let L be a positive line bundle over a compact complex projective manifold X and K be a compact subset of X which is regular in a sense of pluripotential theory. A Fekete configuration of order k is a finite subset of K maximizing a…
Opial's Lemma is a fundamental result in the convergence analysis of sequences generated by optimization algorithms in real Hilbert spaces. We introduce the concept of Opial sequences - sequences for which the limit of the distance to each…
A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…
In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pt\'ak. We show that the validity of the result for $\omega_1$ can not be decided in ZFC alone. We also provide a…
Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, and later researchers showed that the distribution of the number of summands needed for such decompositions of integers in…
The Riemann Hypothesis has been of central interest to mathematicians for a long time and many unsuccessful attempts have been made to either prove or disprove it. Since the Riemann zeta function is defined as a sum of the infinite number…