Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Péter Hajnal"'
Autor:
Péter Hajnal
Publikováno v:
Algorithms, Vol 17, Iss 2, p 55 (2024)
The binary number system is the basic number representation in computing. We can encode natural numbers with finite 0-1 sequences. The representation of natural numbers is based on this system. However, this poses problems and is technically not perf
Externí odkaz:
https://doaj.org/article/3fe0c940f7634ac28a99ae24501ac083
Autor:
Péter Hajnal
Publikováno v:
Acta Universitatis Sapientiae, Mathematica. 14:231-238
A permutation p of [k] = {1, 2, 3, …, k} is called Layman permutation iff i + p(i) is a Fibonacci number for 1 ≤ i ≤ k. This concept is introduced by Layman in the A097082 entry of the Encyclopedia of Integers Sequences, that is the number of L
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19d7b6dfb5305069921f4aab2b2c9380
https://doi.org/10.2478/ausm-2022-0015
https://doi.org/10.2478/ausm-2022-0015
Autor:
Péter Hajnal
Publikováno v:
Acta Humana. 7:41-54
I have been working as an administrative judge for 30 years. I lived and underwent all the judicial organizational and procedural changes. My brief recollection is personal in that I present the last nearly 30 years from the beginning until the estab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63794b4960b437cc0620c05cc02893b6
https://doi.org/10.32566/ah.2019.1.3
https://doi.org/10.32566/ah.2019.1.3
Autor:
Miklós Fagyas, István Altorjay, Enikő E. Enyedi, Alexandra Csongrádi, Péter Hajnal, Zoltán Papp, Attila Enyedi, István Takács, Attila Tóth, Gabor A. Fulop
Publikováno v:
Clinica chimica acta; international journal of clinical chemistry. 513
Serum chitotriosidase (CTO) activity was proposed as a biomarker in sarcoidosis being potentially useful in diagnostics. Nevertheless, a common duplication polymorphism (c.1049_1072dup24, Dup24) of the CTO gene influences CTO activity and thereby com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc0eb8ebbea4d92188eae5eab75aef32
https://pubmed.ncbi.nlm.nih.gov/33307063
https://pubmed.ncbi.nlm.nih.gov/33307063
Publikováno v:
Scopus-Elsevier
A nearest neighbor representation of a Boolean function is a set of positive and negative prototypes in $R^n$ such that the function has value 1 on an input iff the closest prototype is positive. For $k$-nearest neighbor representation the majority c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c7193fd825ebc58532329fbbd6b006e
http://arxiv.org/abs/2004.01741
http://arxiv.org/abs/2004.01741
Autor:
Péter Hajnal, Endre Szemerédi
Publikováno v:
Bolyai Society Mathematical Studies ISBN: 9783662574126
The semi-random method was introduced in the early eighties. In its first form of the method lower bounds were given for the size of the largest independent set in hypergraphs with certain uncrowdedness properties. The first geometrical application w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95f0447bc0bb158a9fb7a6986461788f
https://doi.org/10.1007/978-3-662-57413-3_8
https://doi.org/10.1007/978-3-662-57413-3_8
Autor:
Péter Hajnal, Beáta Bényi
Publikováno v:
Studia Scientiarum Mathematicarum Hungarica. 52:537-558
The ${\mathbb B}_n^{(k)}$ poly-Bernoulli numbers --- a natural generalization of classical Bernoulli numbers ($B_n={\mathbb B}_n^{(1)}$) --- were introduced by Kaneko in 1997. When the parameter $k$ is negative then ${\mathbb B}_n^{(k)}$ is a nonnega
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::004f6b1c1e3d396c5aa7fc8f6da2928c
https://doi.org/10.1556/012.2015.52.4.1325
https://doi.org/10.1556/012.2015.52.4.1325
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783662531730
WG
WG
A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at most k com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43c57fab750b1b97c23e8911fbb72193
https://doi.org/10.1007/978-3-662-53174-7_28
https://doi.org/10.1007/978-3-662-53174-7_28
Publikováno v:
European Journal of Combinatorics. 32:276-281
Islands are combinatorial objects that can be intuitively defined on a board consisting of a finite number of cells. Based on the neighbor relation of the cells, it is a fundamental property that two islands are either containing or disjoint. Recentl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98ab83f21d1d3a2870387629984fffab
https://doi.org/10.1016/j.ejc.2010.10.001
https://doi.org/10.1016/j.ejc.2010.10.001
Autor:
Gábor V. Nagy, Péter Hajnal
Publikováno v:
Discrete Mathematics. 310:922-928
We conjecture that any 2-regular simple graph has an SSA labeling. We provide several special cases to support our conjecture. Most of our constructions are based on Skolem sequences and on an extension of it. We establish a connection between simply
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d521665a5ace1f359ffdb8a80779f548
https://doi.org/10.1016/j.disc.2009.10.010
https://doi.org/10.1016/j.disc.2009.10.010