Add to ORKGWe study sequences of positive numbers satisfying a reverse Minkowski condition. In particular, we classify those monotonic decreasing sequences which can be rearranged to satisfy such a condition
We prove that for any weight ϕ defined on [0,1]n that satisfies a reverse Holder inequality with exp...
Let be an ergodic measure-preserving system, let and let . We study the largeness of sets of the ...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
We study sequences of positive numbers satisfying a reverse Minkowski condition. In particular, we c...
We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the...
AbstractWe consider monotone decreasing rearrangement with respect to the finite measure dμ(x) = ϑ(x...
"Natural extension of arithmetic algorithms and S-adic system". July 20～24, 2015. edited by Shigeki ...
Informally, Minkowski's first theorem states that lattices that are globally dense (have small deter...
In this paper, methods of second order and higher order reverse mathematics are applied to versions ...
Abstract. Non-decreasing sequences are a generalization of binary covering arrays, which has made re...
Non-decreasing sequences are a generalization of binary covering arrays, which has made research on ...
The aim of Reverse Mathematics(RM for short)is to find the minimal axioms needed to prove a given th...
AbstractQuasi-linear functions generate sequence transformation methods whose conditioning depends u...
The natural maximal and minimal functions commute pointwise with the logarithm on $A_\infty$. We use...
AbstractThis paper gives a generalization of a result by Matiyasevich which gives explicit rates of ...
We prove that for any weight ϕ defined on [0,1]n that satisfies a reverse Holder inequality with exp...
Let be an ergodic measure-preserving system, let and let . We study the largeness of sets of the ...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
We study sequences of positive numbers satisfying a reverse Minkowski condition. In particular, we c...
We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the...
AbstractWe consider monotone decreasing rearrangement with respect to the finite measure dμ(x) = ϑ(x...
"Natural extension of arithmetic algorithms and S-adic system". July 20～24, 2015. edited by Shigeki ...
Informally, Minkowski's first theorem states that lattices that are globally dense (have small deter...
In this paper, methods of second order and higher order reverse mathematics are applied to versions ...
Abstract. Non-decreasing sequences are a generalization of binary covering arrays, which has made re...
Non-decreasing sequences are a generalization of binary covering arrays, which has made research on ...
The aim of Reverse Mathematics(RM for short)is to find the minimal axioms needed to prove a given th...
AbstractQuasi-linear functions generate sequence transformation methods whose conditioning depends u...
The natural maximal and minimal functions commute pointwise with the logarithm on $A_\infty$. We use...
AbstractThis paper gives a generalization of a result by Matiyasevich which gives explicit rates of ...
We prove that for any weight ϕ defined on [0,1]n that satisfies a reverse Holder inequality with exp...
Let be an ergodic measure-preserving system, let and let . We study the largeness of sets of the ...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...