Related papers: Combinatorial Applications of the Subspace Theorem
Schmidt generalized in 1967 the theory of classical Diophantine approximation to subspaces of $\R^n$. We consider Diophantine exponents for linear subspaces of $\R^n$ which generalize the irrationality measure for real numbers. Using…
In this article we discuss the transcendence of certain infinite sums and products by using the Subspace theorem. In particular we improve the result of Han\v{c}l and Rucki \cite{hancl3}.
The Subspace Theorem due to Schmidt (1972) is a broad generalisation of Roth's Theorem in Diophantine Approximation (1955) which, in the same way as the latter, suffers a notorious lack of effectivity. This problem is tackled from a…
The task of approximating a function of d variables from its evaluations at a given number of points is ubiquitous in numerical analysis and engineering applications. When d is large, this task is challenged by the so-called curse of…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…
Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on ultrafilters tend to be shorter and more…
Submodular functions are discrete functions that model laws of diminishing returns and enjoy numerous algorithmic applications. They have been used in many areas, including combinatorial optimization, machine learning, and economics. In…
The purpose of this paper is to present some multidimensional fixed-point theorems and their applications. For this, we provide a multidimensional fixed point theorem and then using this theorem we prove the existence and uniqueness of a…
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…
We give a new proof of a characterization of the closeness of the range of a continuous linear operator and of the closeness of the sum of two closed vector subspaces of a Banach space. Then we state sufficient conditions for the closeness…
This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…
The structural invariant subspaces of the discrete-time singular Hamiltonian system are used in 1] to give an analytic nonrecursive expression of all the admissible trajectories. A deeper insight into the features of these subspaces,…
Using Schmidt's Subspace Theorem, this paper improves and extends an existing transcendence result for sequences of algebraic numbers. The theorems thus produced correspond to a central theorem on the irrationality of sequences due to…
Addition theorems have been indispensable tools for the reduction of quantum transition amplitudes. They are normally utilized at the start of the process to move the angular dependence within plane waves and Coulomb potentials, and the…
In a polydiagonal subspace of the Euclidean space, certain components of the vectors are equal (synchrony) or opposite (anti-synchrony). Polydiagonal subspaces invariant under a matrix have many applications in graph theory and dynamical…
We discuss a structural approach to subset-sum problems in additive combinatorics. The core of this approach are Freiman-type structural theorems, many of which will be presented through the paper. These results have applications in various…
Ultrafilters are a tool, originating in mathematical logic and general topology, that has steadily found more and more uses in multiple areas of mathematics, such as combinatorics, dynamics, and algebra, among others. The purpose of this…