Related papers: Bounds for D-finite closure properties
We provide bounds on the size of polynomial differential equations obtained by executing closure properties for D-algebraic functions. While it is easy to obtain bounds on the order of these equations, it requires some more work to derive…
It is known for linear operators with polynomial coefficients annihilating a given D-finite function that there is a trade-off between order and degree. Raising the order may give room for lowering the degree. The relationship between order…
It is well known that the composition of a D-finite function with an algebraic function is again D-finite. We give the first estimates for the orders and the degrees of annihilating operators for the compositions. We find that the analysis…
We introduce a new definition of topological degree for a meaningful class of operators which need not be continuous. Subsequently, we derive a number of fixed point theorems for such operators. As an application, we deduce a new existence…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
We bound the size of $d$-dimensional cubulations of finitely presented groups. We apply this bound to obtain acylindrical accessibility for actions on CAT(0) cube complexes and bounds on curves on surfaces.
We bound certain r-maximal restriction operators on the moment curve.
A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…
We deal with a problem of finding maximum of a function from the Holder class on a quantum computer. We show matching lower and upper bounds on the complexity of this problem. We prove upper bounds by constructing an algorithm that uses the…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
An upper bound on operator norms of compound matrices is presented, and special cases that involve the $\ell_1$, $\ell_2$ and $\ell_\infty$ norms are investigated. The results are then used to obtain bounds on products of the largest or…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
We obtain bounds on the complex eigenvalues of non-self-adjoint Schr\"odinger operators with complex potentials, and also on the complex resonances of self-adjoint Schr\"odinger operators. Our bounds are compared with numerical results, and…
We study the graded limits of minimal affinizations over a quantum loop algebra of type D in the regular case. We show that the graded limits are isomorphic to multiple generalizations of Demazure modules, and also give their defining…
We consider Schr\"odinger operators of the form $H_R = - d^2/ d x^2 + q + i \gamma \chi_{[0,R]}$ for large $R>0$, where $q \in L^1(0,\infty)$ and $\gamma > 0$. Bounds for the maximum magnitude of an eigenvalue and for the number of…
We give some new characterizations of almost weak Dunford-Pettis operators and we investigate their relationship with weak Dunford-Pettis operators.
We study the complexity of closure operators, with applications to machine learning and decision theory. In machine learning, closure operators emerge naturally in data classification and clustering. In decision theory, they can model…
We obtain upper and lower bounds for the Davis-Wielandt radius of bounded linear operators defined on a complex Hilbert space, which improve on the existing ones. We also obtain bounds for the Davis-Wielandt radius of operator matrices. We…