---
_id: '55276'
author:
- first_name: P.
  full_name: Minelli, P.
  last_name: Minelli
- first_name: A.
  full_name: Sourmelidis, A.
  last_name: Sourmelidis
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Minelli P, Sourmelidis A, Technau M. On restricted averages of Dedekind sums.
    <i>Int Math Res Not IMRN</i>. 2024;2024(10):8485–8502. doi:<a href="https://doi.org/10.1093/imrn/rnad283">10.1093/imrn/rnad283</a>
  apa: Minelli, P., Sourmelidis, A., &#38; Technau, M. (2024). On restricted averages
    of Dedekind sums. <i>Int. Math. Res. Not. IMRN</i>, <i>2024</i>(10), 8485–8502.
    <a href="https://doi.org/10.1093/imrn/rnad283">https://doi.org/10.1093/imrn/rnad283</a>
  bibtex: '@article{Minelli_Sourmelidis_Technau_2024, title={On restricted averages
    of Dedekind sums}, volume={2024}, DOI={<a href="https://doi.org/10.1093/imrn/rnad283">10.1093/imrn/rnad283</a>},
    number={10}, journal={Int. Math. Res. Not. IMRN}, author={Minelli, P. and Sourmelidis,
    A. and Technau, Marc}, year={2024}, pages={8485–8502} }'
  chicago: 'Minelli, P., A. Sourmelidis, and Marc Technau. “On Restricted Averages
    of Dedekind Sums.” <i>Int. Math. Res. Not. IMRN</i> 2024, no. 10 (2024): 8485–8502.
    <a href="https://doi.org/10.1093/imrn/rnad283">https://doi.org/10.1093/imrn/rnad283</a>.'
  ieee: 'P. Minelli, A. Sourmelidis, and M. Technau, “On restricted averages of Dedekind
    sums,” <i>Int. Math. Res. Not. IMRN</i>, vol. 2024, no. 10, pp. 8485–8502, 2024,
    doi: <a href="https://doi.org/10.1093/imrn/rnad283">10.1093/imrn/rnad283</a>.'
  mla: Minelli, P., et al. “On Restricted Averages of Dedekind Sums.” <i>Int. Math.
    Res. Not. IMRN</i>, vol. 2024, no. 10, 2024, pp. 8485–8502, doi:<a href="https://doi.org/10.1093/imrn/rnad283">10.1093/imrn/rnad283</a>.
  short: P. Minelli, A. Sourmelidis, M. Technau, Int. Math. Res. Not. IMRN 2024 (2024)
    8485–8502.
date_created: 2024-07-16T11:09:00Z
date_updated: 2024-07-24T07:23:20Z
department:
- _id: '102'
doi: 10.1093/imrn/rnad283
intvolume: '      2024'
issue: '10'
language:
- iso: eng
page: 8485–8502
publication: Int. Math. Res. Not. IMRN
status: public
title: On restricted averages of Dedekind sums
type: journal_article
user_id: '106108'
volume: 2024
year: '2024'
...
---
_id: '55278'
author:
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Technau M. Remark on the Farey fraction spin chain. <i>Proc Amer Math Soc</i>.
    2024;152(1):63–69. doi:<a href="https://doi.org/10.1090/proc/16520">10.1090/proc/16520</a>
  apa: Technau, M. (2024). Remark on the Farey fraction spin chain. <i>Proc. Amer.
    Math. Soc.</i>, <i>152</i>(1), 63–69. <a href="https://doi.org/10.1090/proc/16520">https://doi.org/10.1090/proc/16520</a>
  bibtex: '@article{Technau_2024, title={Remark on the Farey fraction spin chain},
    volume={152}, DOI={<a href="https://doi.org/10.1090/proc/16520">10.1090/proc/16520</a>},
    number={1}, journal={Proc. Amer. Math. Soc.}, author={Technau, Marc}, year={2024},
    pages={63–69} }'
  chicago: 'Technau, Marc. “Remark on the Farey Fraction Spin Chain.” <i>Proc. Amer.
    Math. Soc.</i> 152, no. 1 (2024): 63–69. <a href="https://doi.org/10.1090/proc/16520">https://doi.org/10.1090/proc/16520</a>.'
  ieee: 'M. Technau, “Remark on the Farey fraction spin chain,” <i>Proc. Amer. Math.
    Soc.</i>, vol. 152, no. 1, pp. 63–69, 2024, doi: <a href="https://doi.org/10.1090/proc/16520">10.1090/proc/16520</a>.'
  mla: Technau, Marc. “Remark on the Farey Fraction Spin Chain.” <i>Proc. Amer. Math.
    Soc.</i>, vol. 152, no. 1, 2024, pp. 63–69, doi:<a href="https://doi.org/10.1090/proc/16520">10.1090/proc/16520</a>.
  short: M. Technau, Proc. Amer. Math. Soc. 152 (2024) 63–69.
date_created: 2024-07-16T11:09:01Z
date_updated: 2024-07-24T07:26:12Z
department:
- _id: '102'
doi: 10.1090/proc/16520
extern: '1'
intvolume: '       152'
issue: '1'
language:
- iso: eng
page: 63–69
publication: Proc. Amer. Math. Soc.
status: public
title: Remark on the Farey fraction spin chain
type: journal_article
user_id: '106108'
volume: 152
year: '2024'
...
---
_id: '55277'
author:
- first_name: B.
  full_name: Klahn, B.
  last_name: Klahn
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Klahn B, Technau M. Galois groups of (<sup>n</sup>₀)+(<sup>n</sup>₁)X+…+(<sup>n</sup>₆)X<sup>6</sup>.
    <i>Int J Number Theory</i>. 2023;19(10):2443–2450. doi:<a href="https://doi.org/10.1142/S1793042123501208">10.1142/S1793042123501208</a>
  apa: Klahn, B., &#38; Technau, M. (2023). Galois groups of (<sup>n</sup>₀)+(<sup>n</sup>₁)X+…+(<sup>n</sup>₆)X<sup>6</sup>.
    <i>Int. J. Number Theory</i>, <i>19</i>(10), 2443–2450. <a href="https://doi.org/10.1142/S1793042123501208">https://doi.org/10.1142/S1793042123501208</a>
  bibtex: '@article{Klahn_Technau_2023, title={Galois groups of (<sup>n</sup>₀)+(<sup>n</sup>₁)X+…+(<sup>n</sup>₆)X<sup>6</sup>},
    volume={19}, DOI={<a href="https://doi.org/10.1142/S1793042123501208">10.1142/S1793042123501208</a>},
    number={10}, journal={Int. J. Number Theory}, author={Klahn, B. and Technau, Marc},
    year={2023}, pages={2443–2450} }'
  chicago: 'Klahn, B., and Marc Technau. “Galois Groups of (<sup>n</sup>₀)+(<sup>n</sup>₁)X+…+(<sup>n</sup>₆)X<sup>6</sup>.”
    <i>Int. J. Number Theory</i> 19, no. 10 (2023): 2443–2450. <a href="https://doi.org/10.1142/S1793042123501208">https://doi.org/10.1142/S1793042123501208</a>.'
  ieee: 'B. Klahn and M. Technau, “Galois groups of (<sup>n</sup>₀)+(<sup>n</sup>₁)X+…+(<sup>n</sup>₆)X<sup>6</sup>,”
    <i>Int. J. Number Theory</i>, vol. 19, no. 10, pp. 2443–2450, 2023, doi: <a href="https://doi.org/10.1142/S1793042123501208">10.1142/S1793042123501208</a>.'
  mla: Klahn, B., and Marc Technau. “Galois Groups of (<sup>n</sup>₀)+(<sup>n</sup>₁)X+…+(<sup>n</sup>₆)X<sup>6</sup>.”
    <i>Int. J. Number Theory</i>, vol. 19, no. 10, 2023, pp. 2443–2450, doi:<a href="https://doi.org/10.1142/S1793042123501208">10.1142/S1793042123501208</a>.
  short: B. Klahn, M. Technau, Int. J. Number Theory 19 (2023) 2443–2450.
date_created: 2024-07-16T11:09:01Z
date_updated: 2024-07-24T07:23:33Z
department:
- _id: '102'
doi: 10.1142/S1793042123501208
extern: '1'
intvolume: '        19'
issue: '10'
language:
- iso: eng
page: 2443–2450
publication: Int. J. Number Theory
status: public
title: Galois groups of (ⁿ₀)+(ⁿ₁)X+…+(ⁿ₆)X⁶
type: journal_article
user_id: '106108'
volume: 19
year: '2023'
...
---
_id: '55279'
author:
- first_name: P.
  full_name: Minelli, P.
  last_name: Minelli
- first_name: A.
  full_name: Sourmelidis, A.
  last_name: Sourmelidis
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Minelli P, Sourmelidis A, Technau M. Bias in the number of steps in the Euclidean
    algorithm and a conjecture of Ito on Dedekind sums. <i>Math Ann</i>. 2023;387:291–320.
    doi:<a href="https://doi.org/10.1007/s00208-022-02452-2">10.1007/s00208-022-02452-2</a>
  apa: Minelli, P., Sourmelidis, A., &#38; Technau, M. (2023). Bias in the number
    of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums.
    <i>Math. Ann.</i>, <i>387</i>, 291–320. <a href="https://doi.org/10.1007/s00208-022-02452-2">https://doi.org/10.1007/s00208-022-02452-2</a>
  bibtex: '@article{Minelli_Sourmelidis_Technau_2023, title={Bias in the number of
    steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums}, volume={387},
    DOI={<a href="https://doi.org/10.1007/s00208-022-02452-2">10.1007/s00208-022-02452-2</a>},
    journal={Math. Ann.}, author={Minelli, P. and Sourmelidis, A. and Technau, Marc},
    year={2023}, pages={291–320} }'
  chicago: 'Minelli, P., A. Sourmelidis, and Marc Technau. “Bias in the Number of
    Steps in the Euclidean Algorithm and a Conjecture of Ito on Dedekind Sums.” <i>Math.
    Ann.</i> 387 (2023): 291–320. <a href="https://doi.org/10.1007/s00208-022-02452-2">https://doi.org/10.1007/s00208-022-02452-2</a>.'
  ieee: 'P. Minelli, A. Sourmelidis, and M. Technau, “Bias in the number of steps
    in the Euclidean algorithm and a conjecture of Ito on Dedekind sums,” <i>Math.
    Ann.</i>, vol. 387, pp. 291–320, 2023, doi: <a href="https://doi.org/10.1007/s00208-022-02452-2">10.1007/s00208-022-02452-2</a>.'
  mla: Minelli, P., et al. “Bias in the Number of Steps in the Euclidean Algorithm
    and a Conjecture of Ito on Dedekind Sums.” <i>Math. Ann.</i>, vol. 387, 2023,
    pp. 291–320, doi:<a href="https://doi.org/10.1007/s00208-022-02452-2">10.1007/s00208-022-02452-2</a>.
  short: P. Minelli, A. Sourmelidis, M. Technau, Math. Ann. 387 (2023) 291–320.
date_created: 2024-07-16T11:09:01Z
date_updated: 2024-07-24T07:26:05Z
department:
- _id: '102'
doi: 10.1007/s00208-022-02452-2
extern: '1'
intvolume: '       387'
language:
- iso: eng
page: 291–320
publication: Math. Ann.
status: public
title: Bias in the number of steps in the Euclidean algorithm and a conjecture of
  Ito on Dedekind sums
type: journal_article
user_id: '106108'
volume: 387
year: '2023'
...
---
_id: '55280'
author:
- first_name: Ch.
  full_name: Elsholtz, Ch.
  last_name: Elsholtz
- first_name: B.
  full_name: Klahn, B.
  last_name: Klahn
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Elsholtz Ch, Klahn B, Technau M. On polynomials with roots modulo almost all
    primes. <i>Acta Arith</i>. 2022;205:3(3):251–263. doi:<a href="https://doi.org/10.4064/aa220407-9-7">10.4064/aa220407-9-7</a>
  apa: Elsholtz, Ch., Klahn, B., &#38; Technau, M. (2022). On polynomials with roots
    modulo almost all primes. <i>Acta Arith.</i>, <i>205:3</i>(3), 251–263. <a href="https://doi.org/10.4064/aa220407-9-7">https://doi.org/10.4064/aa220407-9-7</a>
  bibtex: '@article{Elsholtz_Klahn_Technau_2022, title={On polynomials with roots
    modulo almost all primes}, volume={205:3}, DOI={<a href="https://doi.org/10.4064/aa220407-9-7">10.4064/aa220407-9-7</a>},
    number={3}, journal={Acta Arith.}, author={Elsholtz, Ch. and Klahn, B. and Technau,
    Marc}, year={2022}, pages={251–263} }'
  chicago: 'Elsholtz, Ch., B. Klahn, and Marc Technau. “On Polynomials with Roots
    modulo Almost All Primes.” <i>Acta Arith.</i> 205:3, no. 3 (2022): 251–263. <a
    href="https://doi.org/10.4064/aa220407-9-7">https://doi.org/10.4064/aa220407-9-7</a>.'
  ieee: 'Ch. Elsholtz, B. Klahn, and M. Technau, “On polynomials with roots modulo
    almost all primes,” <i>Acta Arith.</i>, vol. 205:3, no. 3, pp. 251–263, 2022,
    doi: <a href="https://doi.org/10.4064/aa220407-9-7">10.4064/aa220407-9-7</a>.'
  mla: Elsholtz, Ch., et al. “On Polynomials with Roots modulo Almost All Primes.”
    <i>Acta Arith.</i>, vol. 205:3, no. 3, 2022, pp. 251–263, doi:<a href="https://doi.org/10.4064/aa220407-9-7">10.4064/aa220407-9-7</a>.
  short: Ch. Elsholtz, B. Klahn, M. Technau, Acta Arith. 205:3 (2022) 251–263.
date_created: 2024-07-16T11:09:01Z
date_updated: 2024-07-24T07:26:22Z
department:
- _id: '102'
doi: 10.4064/aa220407-9-7
extern: '1'
issue: '3'
language:
- iso: eng
page: 251–263
publication: Acta Arith.
status: public
title: On polynomials with roots modulo almost all primes
type: journal_article
user_id: '106108'
volume: 205:3
year: '2022'
...
---
_id: '55290'
author:
- first_name: St.
  full_name: Baier, St.
  last_name: Baier
- first_name: D.
  full_name: Mazumder, D.
  last_name: Mazumder
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Baier St, Mazumder D, Technau M. On the distribution of αp modulo one in quadratic
    number fields. <i>Unif Distrib Theory</i>. 2021;16(2):1–48. doi:<a href="https://doi.org/10.2478/udt-2021-0006">10.2478/udt-2021-0006</a>
  apa: Baier, St., Mazumder, D., &#38; Technau, M. (2021). On the distribution of
    αp modulo one in quadratic number fields. <i>Unif. Distrib. Theory</i>, <i>16</i>(2),
    1–48. <a href="https://doi.org/10.2478/udt-2021-0006">https://doi.org/10.2478/udt-2021-0006</a>
  bibtex: '@article{Baier_Mazumder_Technau_2021, title={On the distribution of αp
    modulo one in quadratic number fields}, volume={16}, DOI={<a href="https://doi.org/10.2478/udt-2021-0006">10.2478/udt-2021-0006</a>},
    number={2}, journal={Unif. Distrib. Theory}, author={Baier, St. and Mazumder,
    D. and Technau, Marc}, year={2021}, pages={1–48} }'
  chicago: 'Baier, St., D. Mazumder, and Marc Technau. “On the Distribution of Αp
    modulo One in Quadratic Number Fields.” <i>Unif. Distrib. Theory</i> 16, no. 2
    (2021): 1–48. <a href="https://doi.org/10.2478/udt-2021-0006">https://doi.org/10.2478/udt-2021-0006</a>.'
  ieee: 'St. Baier, D. Mazumder, and M. Technau, “On the distribution of αp modulo
    one in quadratic number fields,” <i>Unif. Distrib. Theory</i>, vol. 16, no. 2,
    pp. 1–48, 2021, doi: <a href="https://doi.org/10.2478/udt-2021-0006">10.2478/udt-2021-0006</a>.'
  mla: Baier, St., et al. “On the Distribution of Αp modulo One in Quadratic Number
    Fields.” <i>Unif. Distrib. Theory</i>, vol. 16, no. 2, 2021, pp. 1–48, doi:<a
    href="https://doi.org/10.2478/udt-2021-0006">10.2478/udt-2021-0006</a>.
  short: St. Baier, D. Mazumder, M. Technau, Unif. Distrib. Theory 16 (2021) 1–48.
date_created: 2024-07-16T11:09:03Z
date_updated: 2024-07-24T07:23:43Z
department:
- _id: '102'
doi: 10.2478/udt-2021-0006
extern: '1'
intvolume: '        16'
issue: '2'
language:
- iso: eng
page: 1–48
publication: Unif. Distrib. Theory
status: public
title: On the distribution of αp modulo one in quadratic number fields
type: journal_article
user_id: '106108'
volume: 16
year: '2021'
...
---
_id: '55289'
author:
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
- first_name: A.
  full_name: Zafeiropoulos, A.
  last_name: Zafeiropoulos
citation:
  ama: Technau M, Zafeiropoulos A. Metric results on summatory arithmetic functions
    on Beatty sets. <i>Acta Arith</i>. 2021;197(1):93–104. doi:<a href="https://doi.org/10.4064/aa200128-10-6">10.4064/aa200128-10-6</a>
  apa: Technau, M., &#38; Zafeiropoulos, A. (2021). Metric results on summatory arithmetic
    functions on Beatty sets. <i>Acta Arith.</i>, <i>197</i>(1), 93–104. <a href="https://doi.org/10.4064/aa200128-10-6">https://doi.org/10.4064/aa200128-10-6</a>
  bibtex: '@article{Technau_Zafeiropoulos_2021, title={Metric results on summatory
    arithmetic functions on Beatty sets}, volume={197}, DOI={<a href="https://doi.org/10.4064/aa200128-10-6">10.4064/aa200128-10-6</a>},
    number={1}, journal={Acta Arith.}, author={Technau, Marc and Zafeiropoulos, A.},
    year={2021}, pages={93–104} }'
  chicago: 'Technau, Marc, and A. Zafeiropoulos. “Metric Results on Summatory Arithmetic
    Functions on Beatty Sets.” <i>Acta Arith.</i> 197, no. 1 (2021): 93–104. <a href="https://doi.org/10.4064/aa200128-10-6">https://doi.org/10.4064/aa200128-10-6</a>.'
  ieee: 'M. Technau and A. Zafeiropoulos, “Metric results on summatory arithmetic
    functions on Beatty sets,” <i>Acta Arith.</i>, vol. 197, no. 1, pp. 93–104, 2021,
    doi: <a href="https://doi.org/10.4064/aa200128-10-6">10.4064/aa200128-10-6</a>.'
  mla: Technau, Marc, and A. Zafeiropoulos. “Metric Results on Summatory Arithmetic
    Functions on Beatty Sets.” <i>Acta Arith.</i>, vol. 197, no. 1, 2021, pp. 93–104,
    doi:<a href="https://doi.org/10.4064/aa200128-10-6">10.4064/aa200128-10-6</a>.
  short: M. Technau, A. Zafeiropoulos, Acta Arith. 197 (2021) 93–104.
date_created: 2024-07-16T11:09:03Z
date_updated: 2024-07-24T07:25:48Z
department:
- _id: '102'
doi: 10.4064/aa200128-10-6
extern: '1'
intvolume: '       197'
issue: '1'
language:
- iso: eng
page: 93–104
publication: Acta Arith.
status: public
title: Metric results on summatory arithmetic functions on Beatty sets
type: journal_article
user_id: '106108'
volume: 197
year: '2021'
...
---
_id: '55288'
author:
- first_name: St.
  full_name: Baier, St.
  last_name: Baier
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Baier St, Technau M. On the distribution of αp modulo one in imaginary quadratic
    number fields with class number one. <i>J Théor Nombres Bordx</i>. 2020;32(2):719–760.
    doi:<a href="https://doi.org/10.5802/jtnb.1141">10.5802/jtnb.1141</a>
  apa: Baier, St., &#38; Technau, M. (2020). On the distribution of αp modulo one
    in imaginary quadratic number fields with class number one. <i>J. Théor. Nombres
    Bordx.</i>, <i>32</i>(2), 719–760. <a href="https://doi.org/10.5802/jtnb.1141">https://doi.org/10.5802/jtnb.1141</a>
  bibtex: '@article{Baier_Technau_2020, title={On the distribution of αp modulo one
    in imaginary quadratic number fields with class number one}, volume={32}, DOI={<a
    href="https://doi.org/10.5802/jtnb.1141">10.5802/jtnb.1141</a>}, number={2}, journal={J.
    Théor. Nombres Bordx.}, author={Baier, St. and Technau, Marc}, year={2020}, pages={719–760}
    }'
  chicago: 'Baier, St., and Marc Technau. “On the Distribution of Αp modulo One in
    Imaginary Quadratic Number Fields with Class Number One.” <i>J. Théor. Nombres
    Bordx.</i> 32, no. 2 (2020): 719–760. <a href="https://doi.org/10.5802/jtnb.1141">https://doi.org/10.5802/jtnb.1141</a>.'
  ieee: 'St. Baier and M. Technau, “On the distribution of αp modulo one in imaginary
    quadratic number fields with class number one,” <i>J. Théor. Nombres Bordx.</i>,
    vol. 32, no. 2, pp. 719–760, 2020, doi: <a href="https://doi.org/10.5802/jtnb.1141">10.5802/jtnb.1141</a>.'
  mla: Baier, St., and Marc Technau. “On the Distribution of Αp modulo One in Imaginary
    Quadratic Number Fields with Class Number One.” <i>J. Théor. Nombres Bordx.</i>,
    vol. 32, no. 2, 2020, pp. 719–760, doi:<a href="https://doi.org/10.5802/jtnb.1141">10.5802/jtnb.1141</a>.
  short: St. Baier, M. Technau, J. Théor. Nombres Bordx. 32 (2020) 719–760.
date_created: 2024-07-16T11:09:02Z
date_updated: 2024-07-24T07:23:57Z
department:
- _id: '102'
doi: 10.5802/jtnb.1141
intvolume: '        32'
issue: '2'
language:
- iso: eng
page: 719–760
publication: J. Théor. Nombres Bordx.
status: public
title: On the distribution of αp modulo one in imaginary quadratic number fields with
  class number one
type: journal_article
user_id: '106108'
volume: 32
year: '2020'
...
---
_id: '55286'
author:
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Technau M. Modular hyperbolas and Beatty sequences. <i>J Number Theory</i>.
    2020;208:148–167. doi:<a href="https://doi.org/10.1016/j.jnt.2019.07.022">10.1016/j.jnt.2019.07.022</a>
  apa: Technau, M. (2020). Modular hyperbolas and Beatty sequences. <i>J. Number Theory</i>,
    <i>208</i>, 148–167. <a href="https://doi.org/10.1016/j.jnt.2019.07.022">https://doi.org/10.1016/j.jnt.2019.07.022</a>
  bibtex: '@article{Technau_2020, title={Modular hyperbolas and Beatty sequences},
    volume={208}, DOI={<a href="https://doi.org/10.1016/j.jnt.2019.07.022">10.1016/j.jnt.2019.07.022</a>},
    journal={J. Number Theory}, author={Technau, Marc}, year={2020}, pages={148–167}
    }'
  chicago: 'Technau, Marc. “Modular Hyperbolas and Beatty Sequences.” <i>J. Number
    Theory</i> 208 (2020): 148–167. <a href="https://doi.org/10.1016/j.jnt.2019.07.022">https://doi.org/10.1016/j.jnt.2019.07.022</a>.'
  ieee: 'M. Technau, “Modular hyperbolas and Beatty sequences,” <i>J. Number Theory</i>,
    vol. 208, pp. 148–167, 2020, doi: <a href="https://doi.org/10.1016/j.jnt.2019.07.022">10.1016/j.jnt.2019.07.022</a>.'
  mla: Technau, Marc. “Modular Hyperbolas and Beatty Sequences.” <i>J. Number Theory</i>,
    vol. 208, 2020, pp. 148–167, doi:<a href="https://doi.org/10.1016/j.jnt.2019.07.022">10.1016/j.jnt.2019.07.022</a>.
  short: M. Technau, J. Number Theory 208 (2020) 148–167.
date_created: 2024-07-16T11:09:02Z
date_updated: 2024-07-24T07:24:11Z
department:
- _id: '102'
doi: 10.1016/j.jnt.2019.07.022
extern: '1'
intvolume: '       208'
language:
- iso: eng
page: 148–167
publication: J. Number Theory
status: public
title: Modular hyperbolas and Beatty sequences
type: journal_article
user_id: '106108'
volume: 208
year: '2020'
...
---
_id: '55287'
author:
- first_name: I. E.
  full_name: Shparlinski, I. E.
  last_name: Shparlinski
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Shparlinski IE, Technau M. Kloosterman sums with twice-differentiable functions.
    <i>Funct Approximatio, Comment Math</i>. 2020;63(1):113–124. doi:<a href="https://doi.org/10.7169/facm/1845">10.7169/facm/1845</a>
  apa: Shparlinski, I. E., &#38; Technau, M. (2020). Kloosterman sums with twice-differentiable
    functions. <i>Funct. Approximatio, Comment. Math.</i>, <i>63</i>(1), 113–124.
    <a href="https://doi.org/10.7169/facm/1845">https://doi.org/10.7169/facm/1845</a>
  bibtex: '@article{Shparlinski_Technau_2020, title={Kloosterman sums with twice-differentiable
    functions}, volume={63}, DOI={<a href="https://doi.org/10.7169/facm/1845">10.7169/facm/1845</a>},
    number={1}, journal={Funct. Approximatio, Comment. Math.}, author={Shparlinski,
    I. E. and Technau, Marc}, year={2020}, pages={113–124} }'
  chicago: 'Shparlinski, I. E., and Marc Technau. “Kloosterman Sums with Twice-Differentiable
    Functions.” <i>Funct. Approximatio, Comment. Math.</i> 63, no. 1 (2020): 113–124.
    <a href="https://doi.org/10.7169/facm/1845">https://doi.org/10.7169/facm/1845</a>.'
  ieee: 'I. E. Shparlinski and M. Technau, “Kloosterman sums with twice-differentiable
    functions,” <i>Funct. Approximatio, Comment. Math.</i>, vol. 63, no. 1, pp. 113–124,
    2020, doi: <a href="https://doi.org/10.7169/facm/1845">10.7169/facm/1845</a>.'
  mla: Shparlinski, I. E., and Marc Technau. “Kloosterman Sums with Twice-Differentiable
    Functions.” <i>Funct. Approximatio, Comment. Math.</i>, vol. 63, no. 1, 2020,
    pp. 113–124, doi:<a href="https://doi.org/10.7169/facm/1845">10.7169/facm/1845</a>.
  short: I.E. Shparlinski, M. Technau, Funct. Approximatio, Comment. Math. 63 (2020)
    113–124.
date_created: 2024-07-16T11:09:02Z
date_updated: 2024-07-24T07:25:54Z
department:
- _id: '102'
doi: 10.7169/facm/1845
extern: '1'
intvolume: '        63'
issue: '1'
language:
- iso: eng
page: 113–124
publication: Funct. Approximatio, Comment. Math.
status: public
title: Kloosterman sums with twice-differentiable functions
type: journal_article
user_id: '106108'
volume: 63
year: '2020'
...
---
_id: '55283'
author:
- first_name: D.
  full_name: Barth, D.
  last_name: Barth
- first_name: M.
  full_name: Beck, M.
  last_name: Beck
- first_name: T.
  full_name: Dose, T.
  last_name: Dose
- first_name: Ch.
  full_name: Glaßer, Ch.
  last_name: Glaßer
- first_name: L.
  full_name: Michler, L.
  last_name: Michler
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Barth D, Beck M, Dose T, Glaßer Ch, Michler L, Technau M. Emptiness problems
    for integer circuits. <i>Theoretical Computer Science</i>. 2020;824-825:11–35.
    doi:<a href="https://doi.org/10.1016/j.tcs.2020.03.023">10.1016/j.tcs.2020.03.023</a>
  apa: Barth, D., Beck, M., Dose, T., Glaßer, Ch., Michler, L., &#38; Technau, M.
    (2020). Emptiness problems for integer circuits. <i>Theoretical Computer Science</i>,
    <i>824–825</i>, 11–35. <a href="https://doi.org/10.1016/j.tcs.2020.03.023">https://doi.org/10.1016/j.tcs.2020.03.023</a>
  bibtex: '@article{Barth_Beck_Dose_Glaßer_Michler_Technau_2020, title={Emptiness
    problems for integer circuits}, volume={824–825}, DOI={<a href="https://doi.org/10.1016/j.tcs.2020.03.023">10.1016/j.tcs.2020.03.023</a>},
    journal={Theoretical Computer Science}, author={Barth, D. and Beck, M. and Dose,
    T. and Glaßer, Ch. and Michler, L. and Technau, Marc}, year={2020}, pages={11–35}
    }'
  chicago: 'Barth, D., M. Beck, T. Dose, Ch. Glaßer, L. Michler, and Marc Technau.
    “Emptiness Problems for Integer Circuits.” <i>Theoretical Computer Science</i>
    824–825 (2020): 11–35. <a href="https://doi.org/10.1016/j.tcs.2020.03.023">https://doi.org/10.1016/j.tcs.2020.03.023</a>.'
  ieee: 'D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, and M. Technau, “Emptiness
    problems for integer circuits,” <i>Theoretical Computer Science</i>, vol. 824–825,
    pp. 11–35, 2020, doi: <a href="https://doi.org/10.1016/j.tcs.2020.03.023">10.1016/j.tcs.2020.03.023</a>.'
  mla: Barth, D., et al. “Emptiness Problems for Integer Circuits.” <i>Theoretical
    Computer Science</i>, vol. 824–825, 2020, pp. 11–35, doi:<a href="https://doi.org/10.1016/j.tcs.2020.03.023">10.1016/j.tcs.2020.03.023</a>.
  short: D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, M. Technau, Theoretical
    Computer Science 824–825 (2020) 11–35.
date_created: 2024-07-16T11:09:02Z
date_updated: 2024-07-24T07:25:29Z
department:
- _id: '102'
doi: 10.1016/j.tcs.2020.03.023
extern: '1'
language:
- iso: eng
page: 11–35
publication: Theoretical Computer Science
status: public
title: Emptiness problems for integer circuits
type: journal_article
user_id: '106108'
volume: 824-825
year: '2020'
...
---
_id: '55284'
author:
- first_name: Ch.
  full_name: Elsholtz, Ch.
  last_name: Elsholtz
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
- first_name: N.
  full_name: Technau, N.
  last_name: Technau
citation:
  ama: Elsholtz Ch, Technau M, Technau N. The maximal order of iterated multiplicative
    functions. <i>Mathematika</i>. 2019;64(4):990–1009. doi:<a href="https://doi.org/10.1112/S0025579319000214">10.1112/S0025579319000214</a>
  apa: Elsholtz, Ch., Technau, M., &#38; Technau, N. (2019). The maximal order of
    iterated multiplicative functions. <i>Mathematika</i>, <i>64</i>(4), 990–1009.
    <a href="https://doi.org/10.1112/S0025579319000214">https://doi.org/10.1112/S0025579319000214</a>
  bibtex: '@article{Elsholtz_Technau_Technau_2019, title={The maximal order of iterated
    multiplicative functions}, volume={64}, DOI={<a href="https://doi.org/10.1112/S0025579319000214">10.1112/S0025579319000214</a>},
    number={4}, journal={Mathematika}, author={Elsholtz, Ch. and Technau, Marc and
    Technau, N.}, year={2019}, pages={990–1009} }'
  chicago: 'Elsholtz, Ch., Marc Technau, and N. Technau. “The Maximal Order of Iterated
    Multiplicative Functions.” <i>Mathematika</i> 64, no. 4 (2019): 990–1009. <a href="https://doi.org/10.1112/S0025579319000214">https://doi.org/10.1112/S0025579319000214</a>.'
  ieee: 'Ch. Elsholtz, M. Technau, and N. Technau, “The maximal order of iterated
    multiplicative functions,” <i>Mathematika</i>, vol. 64, no. 4, pp. 990–1009, 2019,
    doi: <a href="https://doi.org/10.1112/S0025579319000214">10.1112/S0025579319000214</a>.'
  mla: Elsholtz, Ch., et al. “The Maximal Order of Iterated Multiplicative Functions.”
    <i>Mathematika</i>, vol. 64, no. 4, 2019, pp. 990–1009, doi:<a href="https://doi.org/10.1112/S0025579319000214">10.1112/S0025579319000214</a>.
  short: Ch. Elsholtz, M. Technau, N. Technau, Mathematika 64 (2019) 990–1009.
date_created: 2024-07-16T11:09:02Z
date_updated: 2024-07-24T07:25:42Z
department:
- _id: '102'
doi: 10.1112/S0025579319000214
extern: '1'
intvolume: '        64'
issue: '4'
language:
- iso: eng
page: 990–1009
publication: Mathematika
status: public
title: The maximal order of iterated multiplicative functions
type: journal_article
user_id: '106108'
volume: 64
year: '2019'
...
---
_id: '55285'
author:
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Technau M. Generalised Beatty sets. <i>Notes Number Theory Discrete Math</i>.
    2019;25(2):127–135. doi:<a href="https://doi.org/10.7546/nntdm.2019.25.2.127-135">10.7546/nntdm.2019.25.2.127-135</a>
  apa: Technau, M. (2019). Generalised Beatty sets. <i>Notes Number Theory Discrete
    Math.</i>, <i>25</i>(2), 127–135. <a href="https://doi.org/10.7546/nntdm.2019.25.2.127-135">https://doi.org/10.7546/nntdm.2019.25.2.127-135</a>
  bibtex: '@article{Technau_2019, title={Generalised Beatty sets}, volume={25}, DOI={<a
    href="https://doi.org/10.7546/nntdm.2019.25.2.127-135">10.7546/nntdm.2019.25.2.127-135</a>},
    number={2}, journal={Notes Number Theory Discrete Math.}, author={Technau, Marc},
    year={2019}, pages={127–135} }'
  chicago: 'Technau, Marc. “Generalised Beatty Sets.” <i>Notes Number Theory Discrete
    Math.</i> 25, no. 2 (2019): 127–135. <a href="https://doi.org/10.7546/nntdm.2019.25.2.127-135">https://doi.org/10.7546/nntdm.2019.25.2.127-135</a>.'
  ieee: 'M. Technau, “Generalised Beatty sets,” <i>Notes Number Theory Discrete Math.</i>,
    vol. 25, no. 2, pp. 127–135, 2019, doi: <a href="https://doi.org/10.7546/nntdm.2019.25.2.127-135">10.7546/nntdm.2019.25.2.127-135</a>.'
  mla: Technau, Marc. “Generalised Beatty Sets.” <i>Notes Number Theory Discrete Math.</i>,
    vol. 25, no. 2, 2019, pp. 127–135, doi:<a href="https://doi.org/10.7546/nntdm.2019.25.2.127-135">10.7546/nntdm.2019.25.2.127-135</a>.
  short: M. Technau, Notes Number Theory Discrete Math. 25 (2019) 127–135.
date_created: 2024-07-16T11:09:02Z
date_updated: 2024-07-24T07:25:59Z
department:
- _id: '102'
doi: 10.7546/nntdm.2019.25.2.127-135
extern: '1'
intvolume: '        25'
issue: '2'
language:
- iso: eng
page: 127–135
publication: Notes Number Theory Discrete Math.
status: public
title: Generalised Beatty sets
type: journal_article
user_id: '106108'
volume: 25
year: '2019'
...
---
_id: '55291'
author:
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Technau M. <i>On Beatty Sets and Some Generalisations Thereof</i>. University
    of Würzburg; 2018. doi:<a href="https://doi.org/10.25972/WUP-978-3-95826-089-4">10.25972/WUP-978-3-95826-089-4</a>
  apa: Technau, M. (2018). <i>On Beatty sets and some generalisations thereof</i>.
    University of Würzburg. <a href="https://doi.org/10.25972/WUP-978-3-95826-089-4">https://doi.org/10.25972/WUP-978-3-95826-089-4</a>
  bibtex: '@book{Technau_2018, place={Würzburg}, title={On Beatty sets and some generalisations
    thereof}, DOI={<a href="https://doi.org/10.25972/WUP-978-3-95826-089-4">10.25972/WUP-978-3-95826-089-4</a>},
    publisher={University of Würzburg}, author={Technau, Marc}, year={2018} }'
  chicago: 'Technau, Marc. <i>On Beatty Sets and Some Generalisations Thereof</i>.
    Würzburg: University of Würzburg, 2018. <a href="https://doi.org/10.25972/WUP-978-3-95826-089-4">https://doi.org/10.25972/WUP-978-3-95826-089-4</a>.'
  ieee: 'M. Technau, <i>On Beatty sets and some generalisations thereof</i>. Würzburg:
    University of Würzburg, 2018.'
  mla: Technau, Marc. <i>On Beatty Sets and Some Generalisations Thereof</i>. University
    of Würzburg, 2018, doi:<a href="https://doi.org/10.25972/WUP-978-3-95826-089-4">10.25972/WUP-978-3-95826-089-4</a>.
  short: M. Technau, On Beatty Sets and Some Generalisations Thereof, University of
    Würzburg, Würzburg, 2018.
date_created: 2024-07-16T11:09:19Z
date_updated: 2024-07-24T07:24:57Z
department:
- _id: '102'
doi: 10.25972/WUP-978-3-95826-089-4
extern: '1'
language:
- iso: eng
place: Würzburg
publisher: University of Würzburg
status: public
supervisor:
- first_name: Jörn
  full_name: Steuding, Jörn
  last_name: Steuding
title: On Beatty sets and some generalisations thereof
type: dissertation
user_id: '106108'
year: '2018'
...
---
_id: '55293'
author:
- first_name: D.
  full_name: Barth, D.
  last_name: Barth
- first_name: M.
  full_name: Beck, M.
  last_name: Beck
- first_name: T.
  full_name: Dose, T.
  last_name: Dose
- first_name: Ch.
  full_name: Glaßer, Ch.
  last_name: Glaßer
- first_name: L.
  full_name: Michler, L.
  last_name: Michler
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Barth D, Beck M, Dose T, Glaßer Ch, Michler L, Technau M. <i>Emptiness Problems
    for Integer Circuits</i>.; 2017.
  apa: Barth, D., Beck, M., Dose, T., Glaßer, Ch., Michler, L., &#38; Technau, M.
    (2017). <i>Emptiness problems for integer circuits</i>.
  bibtex: '@book{Barth_Beck_Dose_Glaßer_Michler_Technau_2017, place={https://eccc.weizmann.ac.il/report/2017/012},
    title={Emptiness problems for integer circuits}, author={Barth, D. and Beck, M.
    and Dose, T. and Glaßer, Ch. and Michler, L. and Technau, Marc}, year={2017} }'
  chicago: Barth, D., M. Beck, T. Dose, Ch. Glaßer, L. Michler, and Marc Technau.
    <i>Emptiness Problems for Integer Circuits</i>. https://eccc.weizmann.ac.il/report/2017/012,
    2017.
  ieee: D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, and M. Technau, <i>Emptiness
    problems for integer circuits</i>. https://eccc.weizmann.ac.il/report/2017/012,
    2017.
  mla: Barth, D., et al. <i>Emptiness Problems for Integer Circuits</i>. 2017.
  short: D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, M. Technau, Emptiness
    Problems for Integer Circuits, https://eccc.weizmann.ac.il/report/2017/012, 2017.
date_created: 2024-07-16T11:09:20Z
date_updated: 2024-07-24T07:24:26Z
department:
- _id: '102'
extern: '1'
language:
- iso: eng
place: https://eccc.weizmann.ac.il/report/2017/012
status: public
title: Emptiness problems for integer circuits
type: report
user_id: '106108'
year: '2017'
...
---
_id: '55292'
author:
- first_name: D.
  full_name: Barth, D.
  last_name: Barth
- first_name: M.
  full_name: Beck, M.
  last_name: Beck
- first_name: T.
  full_name: Dose, T.
  last_name: Dose
- first_name: Ch.
  full_name: Glaßer, Ch.
  last_name: Glaßer
- first_name: L.
  full_name: Michler, L.
  last_name: Michler
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: 'Barth D, Beck M, Dose T, Glaßer Ch, Michler L, Technau M. Emptiness problems
    for integer circuits. In: Larsen KG, Bodlaender HL, Raskin J-F, eds. <i>42nd International
    Symposium on Mathematical Foundations of Computer Science (MFCS 2017)</i>. Vol
    83. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl–Leibniz-Zentrum
    für Informatik; 2017:33:1–33:14. doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2017.33">10.4230/LIPIcs.MFCS.2017.33</a>'
  apa: Barth, D., Beck, M., Dose, T., Glaßer, Ch., Michler, L., &#38; Technau, M.
    (2017). Emptiness problems for integer circuits. In K. G. Larsen, H. L. Bodlaender,
    &#38; J.-F. Raskin (Eds.), <i>42nd International Symposium on Mathematical Foundations
    of Computer Science (MFCS 2017)</i> (Vol. 83, p. 33:1–33:14). Schloss Dagstuhl–Leibniz-Zentrum
    für Informatik. <a href="https://doi.org/10.4230/LIPIcs.MFCS.2017.33">https://doi.org/10.4230/LIPIcs.MFCS.2017.33</a>
  bibtex: '@inproceedings{Barth_Beck_Dose_Glaßer_Michler_Technau_2017, series={Leibniz
    International Proceedings in Informatics (LIPIcs)}, title={Emptiness problems
    for integer circuits}, volume={83}, DOI={<a href="https://doi.org/10.4230/LIPIcs.MFCS.2017.33">10.4230/LIPIcs.MFCS.2017.33</a>},
    booktitle={42nd International Symposium on Mathematical Foundations of Computer
    Science (MFCS 2017)}, publisher={Schloss Dagstuhl–Leibniz-Zentrum für Informatik},
    author={Barth, D. and Beck, M. and Dose, T. and Glaßer, Ch. and Michler, L. and
    Technau, Marc}, editor={Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
    year={2017}, pages={33:1–33:14}, collection={Leibniz International Proceedings
    in Informatics (LIPIcs)} }'
  chicago: Barth, D., M. Beck, T. Dose, Ch. Glaßer, L. Michler, and Marc Technau.
    “Emptiness Problems for Integer Circuits.” In <i>42nd International Symposium
    on Mathematical Foundations of Computer Science (MFCS 2017)</i>, edited by Kim
    G. Larsen, Hans L. Bodlaender, and Jean-Francois Raskin, 83:33:1–33:14. Leibniz
    International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl–Leibniz-Zentrum
    für Informatik, 2017. <a href="https://doi.org/10.4230/LIPIcs.MFCS.2017.33">https://doi.org/10.4230/LIPIcs.MFCS.2017.33</a>.
  ieee: 'D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, and M. Technau, “Emptiness
    problems for integer circuits,” in <i>42nd International Symposium on Mathematical
    Foundations of Computer Science (MFCS 2017)</i>, 2017, vol. 83, p. 33:1–33:14,
    doi: <a href="https://doi.org/10.4230/LIPIcs.MFCS.2017.33">10.4230/LIPIcs.MFCS.2017.33</a>.'
  mla: Barth, D., et al. “Emptiness Problems for Integer Circuits.” <i>42nd International
    Symposium on Mathematical Foundations of Computer Science (MFCS 2017)</i>, edited
    by Kim G. Larsen et al., vol. 83, Schloss Dagstuhl–Leibniz-Zentrum für Informatik,
    2017, p. 33:1–33:14, doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2017.33">10.4230/LIPIcs.MFCS.2017.33</a>.
  short: 'D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, M. Technau, in: K.G.
    Larsen, H.L. Bodlaender, J.-F. Raskin (Eds.), 42nd International Symposium on
    Mathematical Foundations of Computer Science (MFCS 2017), Schloss Dagstuhl–Leibniz-Zentrum
    für Informatik, 2017, p. 33:1–33:14.'
date_created: 2024-07-16T11:09:20Z
date_updated: 2024-07-24T07:25:35Z
department:
- _id: '102'
doi: 10.4230/LIPIcs.MFCS.2017.33
editor:
- first_name: Kim G.
  full_name: Larsen, Kim G.
  last_name: Larsen
- first_name: Hans L.
  full_name: Bodlaender, Hans L.
  last_name: Bodlaender
- first_name: Jean-Francois
  full_name: Raskin, Jean-Francois
  last_name: Raskin
extern: '1'
intvolume: '        83'
language:
- iso: eng
page: 33:1–33:14
publication: 42nd International Symposium on Mathematical Foundations of Computer
  Science (MFCS 2017)
publisher: Schloss Dagstuhl–Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Emptiness problems for integer circuits
type: conference
user_id: '106108'
volume: 83
year: '2017'
...
---
_id: '55275'
author:
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
- first_name: N.
  full_name: Technau, N.
  last_name: Technau
citation:
  ama: Technau M, Technau N. A Loewner equation for infinitely many slits. <i>Comput
    Methods Funct Theory</i>. 2017;17(2):255–272. doi:<a href="https://doi.org/10.1007/s40315-016-0179-6">10.1007/s40315-016-0179-6</a>
  apa: Technau, M., &#38; Technau, N. (2017). A Loewner equation for infinitely many
    slits. <i>Comput. Methods Funct. Theory</i>, <i>17</i>(2), 255–272. <a href="https://doi.org/10.1007/s40315-016-0179-6">https://doi.org/10.1007/s40315-016-0179-6</a>
  bibtex: '@article{Technau_Technau_2017, title={A Loewner equation for infinitely
    many slits}, volume={17}, DOI={<a href="https://doi.org/10.1007/s40315-016-0179-6">10.1007/s40315-016-0179-6</a>},
    number={2}, journal={Comput. Methods Funct. Theory}, author={Technau, Marc and
    Technau, N.}, year={2017}, pages={255–272} }'
  chicago: 'Technau, Marc, and N. Technau. “A Loewner Equation for Infinitely Many
    Slits.” <i>Comput. Methods Funct. Theory</i> 17, no. 2 (2017): 255–272. <a href="https://doi.org/10.1007/s40315-016-0179-6">https://doi.org/10.1007/s40315-016-0179-6</a>.'
  ieee: 'M. Technau and N. Technau, “A Loewner equation for infinitely many slits,”
    <i>Comput. Methods Funct. Theory</i>, vol. 17, no. 2, pp. 255–272, 2017, doi:
    <a href="https://doi.org/10.1007/s40315-016-0179-6">10.1007/s40315-016-0179-6</a>.'
  mla: Technau, Marc, and N. Technau. “A Loewner Equation for Infinitely Many Slits.”
    <i>Comput. Methods Funct. Theory</i>, vol. 17, no. 2, 2017, pp. 255–272, doi:<a
    href="https://doi.org/10.1007/s40315-016-0179-6">10.1007/s40315-016-0179-6</a>.
  short: M. Technau, N. Technau, Comput. Methods Funct. Theory 17 (2017) 255–272.
date_created: 2024-07-16T11:08:06Z
date_updated: 2024-07-24T07:24:37Z
department:
- _id: '102'
doi: 10.1007/s40315-016-0179-6
intvolume: '        17'
issue: '2'
language:
- iso: eng
page: 255–272
publication: Comput. Methods Funct. Theory
status: public
title: A Loewner equation for infinitely many slits
type: journal_article
user_id: '106108'
volume: 17
year: '2017'
...
---
_id: '55281'
author:
- first_name: J.
  full_name: Steuding, J.
  last_name: Steuding
- first_name: Marc
  full_name: Technau, Marc
  id: '106108'
  last_name: Technau
  orcid: 0000-0001-9650-2459
citation:
  ama: Steuding J, Technau M. The least prime number in a Beatty sequence. <i>J Number
    Theory</i>. 2016;169:144–159. doi:<a href="https://doi.org/10.1016/j.jnt.2016.05.022">10.1016/j.jnt.2016.05.022</a>
  apa: Steuding, J., &#38; Technau, M. (2016). The least prime number in a Beatty
    sequence. <i>J. Number Theory</i>, <i>169</i>, 144–159. <a href="https://doi.org/10.1016/j.jnt.2016.05.022">https://doi.org/10.1016/j.jnt.2016.05.022</a>
  bibtex: '@article{Steuding_Technau_2016, title={The least prime number in a Beatty
    sequence}, volume={169}, DOI={<a href="https://doi.org/10.1016/j.jnt.2016.05.022">10.1016/j.jnt.2016.05.022</a>},
    journal={J. Number Theory}, author={Steuding, J. and Technau, Marc}, year={2016},
    pages={144–159} }'
  chicago: 'Steuding, J., and Marc Technau. “The Least Prime Number in a Beatty Sequence.”
    <i>J. Number Theory</i> 169 (2016): 144–159. <a href="https://doi.org/10.1016/j.jnt.2016.05.022">https://doi.org/10.1016/j.jnt.2016.05.022</a>.'
  ieee: 'J. Steuding and M. Technau, “The least prime number in a Beatty sequence,”
    <i>J. Number Theory</i>, vol. 169, pp. 144–159, 2016, doi: <a href="https://doi.org/10.1016/j.jnt.2016.05.022">10.1016/j.jnt.2016.05.022</a>.'
  mla: Steuding, J., and Marc Technau. “The Least Prime Number in a Beatty Sequence.”
    <i>J. Number Theory</i>, vol. 169, 2016, pp. 144–159, doi:<a href="https://doi.org/10.1016/j.jnt.2016.05.022">10.1016/j.jnt.2016.05.022</a>.
  short: J. Steuding, M. Technau, J. Number Theory 169 (2016) 144–159.
date_created: 2024-07-16T11:09:01Z
date_updated: 2024-07-24T07:26:27Z
department:
- _id: '102'
doi: 10.1016/j.jnt.2016.05.022
extern: '1'
intvolume: '       169'
language:
- iso: eng
page: 144–159
publication: J. Number Theory
status: public
title: The least prime number in a Beatty sequence
type: journal_article
user_id: '106108'
volume: 169
year: '2016'
...