Results 41 to 50 of about 618,965 (192)
On inhomogeneous Diophantine approximation and Hausdorff dimension
Let $\Gamma = Z A +Z^n$ be a dense subgroup with rank $n+1$ in $R^n$ and let $\omega(A)$ denote the exponent of uniform simultaneous rational approximation to the point $A$.
Laurent, Michel
core +3 more sources
Combinatorics on number walls and the P(t)$P(t)$‐adic Littlewood conjecture
Abstract In 2004, de Mathan and Teulié stated the p$p$‐adic Littlewood conjecture (p$p$‐LC) in analogy with the classical Littlewood conjecture. Let Fq$\mathbb {F}_q$ be a finite field P(t)$P(t)$ be an irreducible polynomial with coefficients in Fq$\mathbb {F}_q$. This paper deals with the analogue of p$p$‐LC over the ring of formal Laurent series over
Steven Robertson
wiley +1 more source
Generating-function method for tensor products
This is the first of two articles devoted to a exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product (infinite-level) limit of fusions ...
Berenstein A. D. +12 more
core +2 more sources
Additive inhomogeneous Diophantine inequalities [PDF]
Let \(h_1(y),\ldots,h_s(y)\) be polynomials with real coefficients, and put \(H({\mathbf y})=H(y_1,\ldots,y_s)=h_1(y_1)+\cdots+h_s(y_s)\). Suppose throughout that the degree of each \(h_i(y)\) is at most \(k\) and at least one, and that there exists a couple of coefficients of non-constant terms of \(H({\mathbf y})\) such that the ratio of them is ...
openaire +2 more sources
Euclidean algorithms are Gaussian over imaginary quadratic fields
Abstract We prove that the distribution of the number of steps of the Euclidean algorithm of rationals in imaginary quadratic fields with denominators bounded by N$N$ is asymptotically Gaussian as N$N$ goes to infinity, extending a result by Baladi and Vallée for the real case.
Dohyeong Kim, Jungwon Lee, Seonhee Lim
wiley +1 more source
Inhomogeneous Khintchine–Groshev theorem without monotonicity
Abstract The Khintchine–Groshev theorem in Diophantine approximation theory says that there is a dichotomy of the Lebesgue measure of sets of ψ$\psi$‐approximable numbers, given a monotonic function ψ$\psi$. Allen and Ramírez removed the monotonicity condition from the inhomogeneous Khintchine–Groshev theorem for cases with nm⩾3$nm\geqslant 3$ and ...
Seongmin Kim
wiley +1 more source
On a binary Diophantine inequality involving primes of a special type [PDF]
Yuhui Liu
openalex +1 more source
A circle method approach to K‐multimagic squares
Abstract In this paper, we investigate K$K$‐multimagic squares of order N$N$. These are N×N$N \times N$ magic squares that remain magic after raising each element to the k$k$th power for all 2⩽k⩽K$2 \leqslant k \leqslant K$. Given K⩾2$K \geqslant 2$, we consider the problem of establishing the smallest integer N2(K)$N_2(K)$ for which there exist ...
Daniel Flores
wiley +1 more source
Numerical semigroups problem list [PDF]
We propose a list of open problems in numerical semigroups.Comment: To appear in the CIM Bulletin, number 33.
First Problems +4 more
core
K‐stable Fano threefolds of rank 2 and degree 28
Abstract Moduli spaces of Fano varieties have historically been difficult to construct. However, recent work has shown that smooth K‐polystable Fano varieties of fixed dimension and volume can be parametrised by a quasi‐projective moduli space. In this paper, we prove that all smooth Fano threefolds with Picard rank 2 and degree 28 are K‐polystable ...
Joseph Malbon
wiley +1 more source

