Uniform distribution theory Feed

rss_2.0Uniform distribution theory FeedSciendo RSS Feed for Uniform distribution theoryhttps://sciendo.com/journal/UDThttps://www.sciendo.comUniform distribution theory Feedhttps://sciendo-parsed.s3.eu-central-1.amazonaws.com/64739aab4e662f30ba543b31/cover-image.jpghttps://sciendo.com/journal/UDT140216On the Expected ℒ–Discrepancy of Jittered Samplinghttps://sciendo.com/article/10.2478/udt-2023-0005<abstract> <title style='display:none'>Abstract</title> For <italic>m, d</italic> ∈ ℕ, a jittered sample of <italic>N</italic> = <italic>m</italic>d points can be constructed by partitioning [0, 1]d into <italic>m</italic>d axis-aligned equivolume boxes and placing one point independently and uniformly at random inside each box. We utilise a formula for the expected ℒ2−discrepancy of stratified samples stemming from general equivolume partitions of [0, 1]d which recently appeared, to derive a closed form expression for the expected ℒ2−discrepancy of a jittered point set for any <italic>m, d</italic> ∈ ℕ. As a second main result we derive a similar formula for the expected Hickernell ℒ2−discrepancy of a jittered point set which also takes all projections of the point set to lower dimensional faces of the unit cube into account. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2023-00052023-08-10T00:00:00.000+00:00A Note on Well Distributed Sequenceshttps://sciendo.com/article/10.2478/udt-2023-0008<abstract> <title style='display:none'>Abstract</title> We prove an easy statement about inhomogeneous approximation for non-singular vectors in metric theory of Diophantine approximation. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2023-00082023-08-10T00:00:00.000+00:00Copulashttps://sciendo.com/article/10.2478/udt-2023-0009<abstract> <title style='display:none'>Abstract</title> Two-dimensional distribution function <italic>g</italic>(<italic>x, y</italic>) defined in [0, 1]2 is called copula, if <italic>g</italic>(<italic>x,</italic> 1) = <italic>x</italic> and <italic>g</italic>(1,<italic>y</italic>)= <italic>y</italic> for every <italic>x, y</italic>. Similarly, <italic>s</italic>-dimensional copula is a distribution function <italic>g</italic>(<italic>x</italic>1,<italic>x</italic>2,...,<italic>x</italic>s) such that every <italic>k</italic>-dimensional face function <disp-formula> <alternatives> <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_udt-2023-0009_eq_001.png"/> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block"><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math> <tex-math>g\left( {1, \ldots ,1,{x_{{i_1}}},1, \ldots ,1,{x_{{i_2}}},1, \ldots ,1,{x_{{i_k}}},1, \ldots ,1} \right)</tex-math> </alternatives> </disp-formula> is equal to <italic>x</italic>i1 <italic>x</italic>i2 ...<italic>x</italic>ik for some but fixed <italic>k</italic>. In this paper we summarize and extend all known parts of copulas. In this paper we use the following abbreviations: <list list-type="simple"> <list-item>{x} — <italic>fractional part of x</italic>;</list-item> <list-item>{x} — <italic>x mod</italic> 1;</list-item> <list-item>[x] — <italic>integer part of x</italic>;</list-item> <list-item>u.d. — <italic>uniform distribution</italic>;</list-item> <list-item>d.f. — <italic>distribution function</italic>;</list-item> <list-item>a.d.f. — <italic>asymptotic distribution function</italic>;</list-item> <list-item>u.d.p. — <italic>uniform distribution preserving</italic>;</list-item> <list-item>step d.f. — <italic>step distribution function</italic>;</list-item> <list-item>a.e. — <italic>almost everywhere</italic>;</list-item> <list-item>#X — <italic>cardinality of the set X</italic>.</list-item> </list> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2023-00092023-08-10T00:00:00.000+00:00Equidistribution of Continuous Functions Along Monotone Compact Covershttps://sciendo.com/article/10.2478/udt-2023-0004<abstract> <title style='display:none'>Abstract</title> We give a necessary and sufficient condition for equidistribution of continuous functions along monotone compact covers on locally compact spaces. We show the existence of equidistributed mappings along Bohr nets arising from group actions. Using almost periodic means, we give an analogue of Weyl’s equidistribution criterion for continuous functions with values in arbitrary topological groups. We prove van der Corput’s inequality on the lattice ℕm for vectors in Hilbert spaces, and use this inequality to extend Hlawka’s equidistribution theorem to functions on the lattice ℕm (<italic>m</italic> ≥ 1) with values in arbitrary topological groups. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2023-00042023-08-10T00:00:00.000+00:00Random Polynomials in Legendre Symbol Sequenceshttps://sciendo.com/article/10.2478/udt-2023-0006<abstract> <title style='display:none'>Abstract</title> It is important in cryptographic applications that the “key” used should be generated from a random seed. Thus, if the Legendre symbol sequence generated by a polynomial (as proposed by Hoffstein and Lieman) is used, that is <disp-formula> <alternatives> <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_udt-2023-0006_eq_001.png"/> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block"><mml:mrow><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>p</mml:mi></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>p</mml:mi></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>p</mml:mi></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>⋯</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>p</mml:mi></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow> <mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mrow></mml:math> <tex-math>\left\{ {\left( {{{f\left( 1 \right)} \over p}} \right),\left( {{{f\left( 2 \right)} \over p}} \right),\left( {{{f\left( 3 \right)} \over p}} \right), \cdots ,\left( {{{f\left( p \right)} \over p}} \right)} \right\},</tex-math> </alternatives> </disp-formula> then it is important to choose the polynomial <italic>f</italic> “almost” at random. Goubin, Mauduit, and Sárközy presented some not very restrictive conditions on the polynomial <italic>f</italic>, but these conditions may not be satisfied if we choose a “truly” random polynomial. However, how can it be guaranteed that the pseudorandom measures of the sequence should be small for almost "random" polynomials? These semirandom polynomials will be constructed with as few modifications as necessary from a truly random polynomial. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2023-00062023-08-10T00:00:00.000+00:00Approximation of Discrete Measures by Finite Point Setshttps://sciendo.com/article/10.2478/udt-2023-0003<abstract> <title style='display:none'>Abstract</title> For a probability measure <italic>μ</italic> on [0, 1] without discrete component, the best possible order of approximation by a finite point set in terms of the star-discrepancy is &inline as has been proven relatively recently. However, if <italic>μ</italic> contains a discrete component no non-trivial lower bound holds in general because it is straightforward to construct examples without any approximation error in this case. This might explain, why the approximation of discrete measures on [0, 1] by finite point sets has so far not been completely covered in the existing literature. In this note, we close the gap by giving a complete description for discrete measures. Most importantly, we prove that for any discrete measures (not supported on one point only) the best possible order of approximation is for infinitely many <italic>N</italic> bounded from below by &inline for some constant 6 ≥ <italic>c></italic> 2 which depends on the measure. This implies, that for a finitely supported discrete measure on [0, 1]d the known possible order of approximation &inline is indeed the optimal one. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2023-00032023-08-10T00:00:00.000+00:00On a Reduced Component-by-Component Digit-by-Digit Construction of Lattice Point Setshttps://sciendo.com/article/10.2478/udt-2023-0007<abstract> <title style='display:none'>Abstract</title> In this paper, we study an efficient algorithm for constructing point sets underlying quasi-Monte Carlo integration rules for weighted Korobov classes. The algorithm presented is a reduced fast component-by-component digit-by-digit (CBC-DBD) algorithm, which is useful for situations where the weights in the function space show a sufficiently fast decay. The advantage of the algorithm presented here is that the computational effort can be independent of the dimension of the integration problem to be treated if suitable assumptions on the integrand are met. By considering a reduced digit-by-digit construction, we allow an integration algorithm to be less precise with respect to the number of bits in those components of the problem that are considered less important. The new reduced CBC-DBD algorithm is designed to work for the construction of lattice point sets, and the corresponding integration rules (so-called lattice rules) can be used to treat functions in different kinds of function spaces. We show that the integration rules constructed by our algorithm satisfy error bounds of almost optimal convergence order. Furthermore, we give details on an efficient implementation such that we obtain a considerable speed-up of a previously known CBC-DBD algorithm that has been studied in the paper <italic>Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness</italic> by Ebert, Kritzer, Nuyens, and Osisiogu, published in the Journal of Complexity in 2021. This improvement is illustrated by numerical results. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2023-00072023-08-10T00:00:00.000+00:00Refinement of the Theorem of Vahlenhttps://sciendo.com/article/10.2478/udt-2023-0001<abstract> <title style='display:none'>Abstract</title> In 1895, Vahlen proved a theorem concerning a simultaneous approximation of a real number by its two consecutive convergent. In this paper, we will provide a sharper bound for the theorem. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2023-00012023-08-10T00:00:00.000+00:00Notes on the Distribution of Roots Modulo Primes of a Polynomial IVhttps://sciendo.com/article/10.2478/udt-2023-0002<abstract> <title style='display:none'>Abstract</title> For polynomials <italic>f</italic> (<italic>x</italic>),<italic>g</italic>1(<italic>x</italic>),<italic>g</italic>2(<italic>x</italic>)over ℤ, we report several observations about the density of primes <italic>p</italic> for which <italic>f</italic> (<italic>x</italic>) is fully splitting at <italic>p</italic> and <inline-formula> <alternatives> <inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_udt-2023-0002_eq_001.png"/> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>p</mml:mi></mml:mfrac></mml:mrow> <mml:mo>}</mml:mo></mml:mrow><mml:mo><</mml:mo><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>p</mml:mi></mml:mfrac></mml:mrow> <mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math> <tex-math>\left\{ {{{{g_1}\left( r \right)} \over p}} \right\} < \left\{ {{{{g_2}\left( r \right)} \over p}} \right\}</tex-math> </alternatives> </inline-formula> for some root <italic>r</italic> of <italic>f</italic> (<italic>x</italic>) ≡ 0 mod <italic>p</italic>. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2023-00022023-08-10T00:00:00.000+00:00Distribution of Leading Digits of Imaginary Parts of Riemann Zeta Zeroshttps://sciendo.com/article/10.2478/udt-2022-0016<abstract> <title style='display:none'>Abstract</title> In this paper we study the distribution of leading digits of imaginary parts of Riemann zeta zeros in the <italic>b</italic>-adic expansion. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00162022-12-12T00:00:00.000+00:00Non-Archimedean Koksma Inequalities, Variation, and Fourier Analysishttps://sciendo.com/article/10.2478/udt-2022-0011<abstract> <title style='display:none'>Abstract</title> We examine four different notions of variation for real-valued functions defined on the compact ring of integers of a non-Archimedean local field, with an emphasis on regularity properties of functions with finite variation, and on establishing non-Archimedean Koksma inequalities. The first version of variation is due to Taibleson, the second due to Beer, and the remaining two are new. Taibleson variation is the simplest of these, but it is a coarse measure of irregularity and it does not admit a Koksma inequality. Beer variation can be used to prove a Koksma inequality, but it is order-dependent and not translation invariant. We define a new version of variation which may be interpreted as the graph-theoretic variation when a function is naturally extended to a certain subtree of the Berkovich affine line. This variation is order-free and translation invariant, and it admits a Koksma inequality which, for a certain natural family of examples, is always sharper than Beer’s. Finally, we define a Fourier-analytic variation and a corresponding Koksma inequality which is sometimes sharper than the Berkovich-analytic inequality. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00112022-12-12T00:00:00.000+00:00Weyl’s Uniform Distribution Under Periodic Perturbationhttps://sciendo.com/article/10.2478/udt-2022-0015<abstract> <title style='display:none'>Abstract</title> We examine the uniform distribution theory of H. Weyl when there is a periodic perturbation present. As opposed to the classical setting, in this case the conditions for (mod 1) density and (mod 1) uniform distribution turn out to be different. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00152022-12-12T00:00:00.000+00:00On the Derivative of the Minkowski Question-Mark Functionhttps://sciendo.com/article/10.2478/udt-2022-0014<abstract> <title style='display:none'>Abstract</title> The Minkowski question-mark function ?(<italic>x</italic>) is a continuous monotonous function defined on [0, 1] interval. It is well known fact that the derivative of this function, if exists, can take only two values: 0 and +∞.It isalso known that the value of the derivative ? (<italic>x</italic>)atthe point <italic>x</italic> =[0; <italic>a</italic>1,<italic>a</italic>2,...,<italic>a</italic><italic>t</italic>,...] is connected with the limit behaviour of the arithmetic mean (<italic>a</italic>1 +<italic>a</italic>2 +···+<italic>a</italic><italic>t</italic>)<italic>/t</italic>. Particularly, N. Moshchevitin and A. Dushistova showed that if <disp-formula> <alternatives> <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_udt-2022-0014_eq_001.png"/> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mo>⋯</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mi>t</mml:mi></mml:msub><mml:mo><</mml:mo><mml:msub><mml:mrow><mml:mi>κ</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math> <tex-math>{a_1} + {a_2} + \cdots + {a_t} < {\kappa _1},</tex-math> </alternatives> </disp-formula> where <inline-formula> <alternatives> <inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_udt-2022-0014_eq_002.png"/> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mrow><mml:mi>κ</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>log</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msqrt><mml:mn>5</mml:mn></mml:msqrt></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:mo>log</mml:mo><mml:mn>2</mml:mn><mml:mo>=</mml:mo><mml:mn>1.3884</mml:mn><mml:mo>…</mml:mo></mml:mrow></mml:math> <tex-math>{\kappa _1} = 2\log \left( {{{1 + \sqrt 5 } \over 2}} \right)/\log 2 = 1.3884 \ldots</tex-math> </alternatives> </inline-formula>, then ?′(<italic>x</italic>)=+∞.They also proved that the constant <italic>κ</italic>1 is non-improvable. We consider a dual problem: how small can be the quantity <italic>a</italic>1 + <italic>a</italic>2 + ··· + <italic>a</italic><italic>t</italic> − <italic>κ</italic>1<italic>t</italic> if we know that ? (<italic>x</italic>) = 0? We obtain the non-improvable estimates of this quantity. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00142022-12-12T00:00:00.000+00:00A Note on the Distributions of (log )mod 1https://sciendo.com/article/10.2478/udt-2022-0013<abstract> <title style='display:none'>Abstract</title> For sequences sufficiently close to (<italic>a</italic> log <italic>n</italic>), with an arbitrary real constant <italic>a</italic>, this note describes the precise asymptotics of the associated empirical distributions modulo one, with respect to the Kantorovich metric as well as a discrepancy-style metric. In particular, the note demonstrates how these asymptotics depend on <italic>a</italic> in a delicate, discontinuous way. The results strengthen and complement known facts in the literature. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00132022-12-12T00:00:00.000+00:00Kummer Theory for Multiquadratic or Quartic Cyclic Number Fieldshttps://sciendo.com/article/10.2478/udt-2022-0017<abstract> <title style='display:none'>Abstract</title> Let <italic>K</italic> be a number field which is multiquadratic or quartic cyclic. We prove several results about the Kummer extensions of <italic>K</italic>, namely concerning the intersection between the Kummer extensions and the cyclotomic extensions of <italic>K</italic>. For <italic>G</italic> a finitely generated subgroup of <italic>K</italic>×, we consider the cyclotomic-Kummer extensions <inline-formula> <alternatives> <inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_udt-2022-0017_eq_001.png"/> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>ζ</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mroot><mml:mi>G</mml:mi><mml:mi>n</mml:mi></mml:mroot></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>ζ</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math> <tex-math>K\left( {{\zeta _{nt}},\root n \of G } \right)/K\left( {{\zeta _{nt}}} \right)</tex-math> </alternatives> </inline-formula> for all positive integers <italic>n</italic> and <italic>t</italic>, and we describe an explicit finite procedure to compute at once the degree of all these extensions. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00172022-12-12T00:00:00.000+00:00Linear Complexity of Sequences on Koblitz Curves of Genus 2https://sciendo.com/article/10.2478/udt-2022-0010<abstract> <title style='display:none'>Abstract</title> In this paper, we consider the hyperelliptic analogue of the Frobenius endomorphism generator and show that it produces sequences with large linear complexity on the Jacobian of genus 2 curves. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00102022-12-12T00:00:00.000+00:00Consecutive Ratios in Second-Order Linear Recurrence Sequenceshttps://sciendo.com/article/10.2478/udt-2022-0012<abstract> <title style='display:none'>Abstract</title> Let (<italic>a</italic><italic>n</italic>)n=0∞ be a second-order linear recurrence sequence with constant coefficient. We study the limit points and asymptotic distribution of the sequence of consecutive ratios <italic>a</italic><italic>n</italic>+1/<italic>a</italic><italic>n</italic>. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00122022-12-12T00:00:00.000+00:00AO. Univ. Prof. MAG. Dr. Manfred Kühleitner (1967–2022) An Obituaryhttps://sciendo.com/article/10.2478/udt-2022-0009ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00092022-12-12T00:00:00.000+00:00On Some Properties of Irrational Subspaceshttps://sciendo.com/article/10.2478/udt-2022-0002<abstract> <title style='display:none'>Abstract</title> In this paper, we discuss some properties of completely irrational subspaces. We prove that there exist completely irrational subspaces that are badly approximable and, moreover, sets of such subspaces are winning in different senses. We get some bounds for Diophantine exponents of vectors that lie in badly approximable subspaces that are completely irrational; in particular, for any vector <italic>ξ</italic> from two-dimensional badly approximable completely irrational subspace of ℝ<italic>d</italic> one has <inline-formula> <alternatives> <inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_udt-2022-0002_eq_001.png"/> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>ω</mml:mi><mml:mo>⌢</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>ξ</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>≤</mml:mo><mml:mfrac><mml:mrow><mml:msqrt><mml:mrow><mml:mn>5</mml:mn><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msqrt></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:math> <tex-math>\mathord{\buildrel{\lower3pt\hbox{$\scriptscriptstyle\frown$}}\over \omega } \left( \xi \right) \le {{\sqrt {5 - 1} } \over 2}</tex-math> </alternatives> </inline-formula>. Besides that, some statements about the dimension of subspaces generated by best approximations to completely irrational subspace easily follow from properties that we discuss. </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00022022-05-31T00:00:00.000+00:00Insertion in Constructed Normal Numbershttps://sciendo.com/article/10.2478/udt-2022-0008<abstract> <title style='display:none'>Abstract</title> Defined by Borel, a real number is normal to an integer base <italic>b</italic> ≥ 2 if in its base-<italic>b</italic> expansion every block of digits occurs with the same limiting frequency as every other block of the same length. We consider the problem of <italic>insertion</italic> in constructed base-<italic>b</italic> normal expansions to obtain normality to base (<italic>b</italic> + 1). </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/udt-2022-00082022-05-31T00:00:00.000+00:00en-us-1