Related papers: On the Quantitative Subspace Theorem
In 2002, Evertse and Schlickewei obtained a quantitative version of the so-called Absolute Parametric Subspace Theorem. This result deals with a parametrized class of twisted heights. One of the consequences of this result is a quantitative…
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields. A short and self-contained account of some recent progress on this…
we derive new, improved lower bounds for the block complexity of an irrational algebraic number and for the number of digit changes in the b-ary expansion of an irrational algebraic number. To this end, we apply a quantitative version of…
Let $Q$ be an ideal (downward-closed set) in the lattice of linear subspaces of $(\mathbb F_q)^n$, ordered by inclusion. For $0 \le k \le n$, let $\mu_k(Q)$ denote the fraction of $k$-dimensional subspaces that belong to $Q$. We show that…
We study approximation of embeddings between finite dimensional L_p spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The…
Bender, Coley, Robbins and Rumsey posed the problem of counting the number of subspaces which have a given profile with respect to a linear endomorphism defined on a finite vector space. Several special cases of this problem have been…
We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…
Quantum inequalities are bounds on negative time-averages of the energy density of a quantum field. They can be used to rule out exotic spacetimes in general relativity. We study quantum inequalities for a scalar field with a background…
A recently introduced numerical approach to quantum systems is analyzed. The basis of a Fock space is restricted and represented in an algebraic program. Convergence with increasing size of basis is proved and the difference between…
We survey indications from different branches of Physics that the fine scale structure of spacetime is not adequately described by a manifold. Based on the hints we accumulate, we propose a new structure, which we call a quantum topos. In…
We study extensions and generalizations of the Schmidt Subspace Theorem in various settings. In particular, we prove results for algebraic points of bounded degree, giving a sharp version of Schmidt's theorem for quadratic points in the…
A family of logarithmic Sobolev inequalities on finite dimensional quantum state spaces is introduced. The framework of non-commutative $\bL_p$-spaces is reviewed and the relationship between quantum logarithmic Sobolev inequalities and the…
It has recently been shown that small quantum subsystems generically equilibrate, in the sense that they spend most of the time close to a fixed equilibrium state. This relies on just two assumptions: that the state is spread over many…
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 threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation stating that arbitrarily long quantum computations can be performed with a polylogarithmic overhead provided the noise level is below a…
In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space complexity of CNF formulas is always an upper bound on the width needed to refute them. Their proof is beautiful…
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…
By a quantum speed limit one usually understands an estimate on how fast a quantum system can evolve between two distinguishable states. The most known quantum speed limit is given in the form of the celebrated Mandelstam-Tamm inequality…
By a use of the Fredholm determinant theory, the unified quantum entropy notion has been extended to a case of infinite-dimensional systems. Some of the known (in the finite-dimensional case) basic properties of the introduced unified…