Zobrazeno 1 - 10
of 22 940
pro vyhledávání: '"Hajdu, A."'
Autor:
Hajdu, L., Tijdeman, R.
This paper is the continuation of \cite{htl}, where we deal with Lucas sequences. Here we study integers represented by integer sequences which satisfy binary recursive relations. In case of non-degenerate sequences we give bounds for the highest ind
Externí odkaz:
http://arxiv.org/abs/2408.04986
Autor:
Hajdu, L., Tijdeman, R.
In this paper we study the sets of integers which are $n$-th terms of Lucas sequences. We establish lower- and upper bounds for the size of these sets. These bounds are sharp for $n$ sufficiently large. We also develop bounds on the growth order of t
Externí odkaz:
http://arxiv.org/abs/2408.04982
Autor:
Zgirski, Bartłomiej, Gieren, Wolfgang, Pietrzyński, Grzegorz, Górski, Marek, Wielgórski, Piotr, Storm, Jesper, Bras, Garance, Kervella, Pierre, Nardetto, Nicolas, Hajdu, Gergely, Chini, Rolf, Haas, Martin
The Baade-Wesselink method allows us to estimate distances to individual pulsating stars. Accurate geometric parallaxes obtained by the Gaia mission serve us in the calibration of the method and in the determination of its precision. The method also
Externí odkaz:
http://arxiv.org/abs/2408.02102
Autor:
Wielgórski, Piotr, Pietrzyński, Grzegorz, Gieren, Wolfgang, Zgirski, Bartłomiej, Górski, Marek, Storm, Jesper, Nardetto, Nicolas, Kervella, Pierre, Bras, Garance, Hajdu, Gergely, Hocdé, Vincent, Pilecki, Bogumił, Narloch, Weronika, Karczmarek, Paulina, Pych, Wojciech, Chini, Rolf, Hodapp, Klaus
Type II Cepheids are old pulsating stars that can be used to trace the distribution of an old stellar population and to measure distances to globular clusters and galaxies within several megaparsecs. One method that can be used to measure the distanc
Externí odkaz:
http://arxiv.org/abs/2406.16561
Autor:
Narloch, W., Hajdu, G., Pietrzynski, G., Gieren, W., Zgirski, B., Wielgorski, P., Karczmarek, P., Gorski, M., Graczyk, D.
RR Lyrae stars are excellent tracers of the old population II due to their period-luminosity (PL) and period-luminosity-metallicity (PLZ) relations. While these relations have been investigated in detail in many photometric bands, there are few compr
Externí odkaz:
http://arxiv.org/abs/2406.12408
Autor:
Taormina, Mónica, Kudritzki, R. -P., Pilecki, B., Pietrzyński, G., Thompson, I. B., Puls, J., Górski, M., Zgirski, B., Graczyk, D., Gieren, W., Hajdu, G.
We present the results from a complex study of an eclipsing O-type binary (Aa+Ab) with the orbital period $P_{A}=3.2254367$ days, that forms part of a higher-order multiple system in a configuration (A+B)+C. We derived masses of the Aa+Ab binary $M_{
Externí odkaz:
http://arxiv.org/abs/2404.02970
Autor:
Rathour, Rajeev Singh, Hajdu, Gergely, Smolec, Radosław, Karczmarek, Paulina, Hocdé, Vincent, Ziółkowska, Oliwia, Soszyński, Igor, Udalski, Andrzej
Publikováno v:
A&A 686, A268 (2024)
Period change studies give a window to probe into the evolution and dynamics of Cepheids. While evolutionary period changes have been well studied both observationally and theoretically, non-evolutionary period changes lack a systematic and quantitat
Externí odkaz:
http://arxiv.org/abs/2403.14039
Autor:
Pilecki, Bogumił, Thompson, Ian B., Espinoza-Arancibia, Felipe, Hajdu, Gergely, Gieren, Wolfgang, Taormina, Mónica, Pietrzyński, Grzegorz, Narloch, Weronika, Bono, Giuseppe, Gallenne, Alexandre, Kervella, Pierre, Wielgórski, Piotr, Zgirski, Bartłomiej, Graczyk, Dariusz, Karczmarek, Paulina, Evans, Nancy R.
Publikováno v:
A&A 686, A263 (2024)
Binary Cepheids with giant companions are crucial for studying the physical properties of Cepheid variables, providing the best means to measure their masses. Systems composed of two Cepheids are even more important but to date, only one such system
Externí odkaz:
http://arxiv.org/abs/2403.12390
The development of generative large language models (G-LLM) opened up new opportunities for the development of new types of knowledge-based systems similar to ChatGPT, Bing, or Gemini. Fine-tuning (FN) and Retrieval-Augmented Generation (RAG) are the
Externí odkaz:
http://arxiv.org/abs/2403.09727
We present a first-order theorem proving framework for establishing the correctness of functional programs implementing sorting algorithms with recursive data structures. We formalize the semantics of recursive programs in many-sorted first-order log
Externí odkaz:
http://arxiv.org/abs/2403.03712