TY  - JOUR
AU  - Barát, János
TI  - On the number of edges in a K5-minor-free graph of given girth
JF  - DISCRETE MATHEMATICS
J2  - DISCRETE MATH
VL  - 347
PY  - 2024
IS  - 7
SP  - 114042
SN  - 0012-365X
DO  - 10.1016/j.disc.2024.114042
UR  - https://m2.mtmt.hu/api/publication/34831192
ID  - 34831192
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Guzsvinecz, Tibor
AU  - Szűcs, Judit
ED  - Gaál, Eszter
ED  - Szűcs, Judit
ED  - Guzsvinecz, Tibor
TI  - Az egocentrikus és exocentrikus távolságok kapcsolata az e-sporttal
T2  - II. PE ZEK E-Sport Szakmai Napok
PB  - Zalai Egyetemi Sportegyesület
CY  - Zalaegerszeg
SN  - 9786150206707
PY  - 2024
SP  - 8
EP  - 8
PG  - 1
UR  - https://m2.mtmt.hu/api/publication/34827161
ID  - 34827161
LA  - Hungarian
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Németh, Krisztián
AU  - Szabó, Péter
AU  - Bella, Dániel
AU  - Szűcs, Judit
ED  - Gaál, Eszter
ED  - Szűcs, Judit
ED  - Guzsvinecz, Tibor
TI  - Játsszunk? Mérjünk!
T2  - II. PE ZEK E-Sport Szakmai Napok
PB  - Zalai Egyetemi Sportegyesület
CY  - Zalaegerszeg
SN  - 9786150206707
PY  - 2024
SP  - 16
EP  - 16
PG  - 1
UR  - https://m2.mtmt.hu/api/publication/34827152
ID  - 34827152
LA  - Hungarian
DB  - MTMT
ER  - 

TY  - BOOK
ED  - Gaál, Eszter
ED  - Szűcs, Judit
ED  - Guzsvinecz, Tibor
TI  - II. PE ZEK E-Sport Szakmai Napok. Összefoglaló kiadvány
TS  - Összefoglaló kiadvány
PB  - Zalai Egyetemi Sportegyesület
CY  - Zalaegerszeg
PY  - 2024
SP  - 30
SN  - 9786150206707
UR  - https://m2.mtmt.hu/api/publication/34827140
ID  - 34827140
LA  - Hungarian
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Goswami, Angshuman Robin
TI  - Generalizing the concept of bounded variation
JF  - AEQUATIONES MATHEMATICAE
J2  - AEQUATIONES MATH
VL  - 2024
PY  - 2024
SN  - 0001-9054
DO  - 10.1007/s00010-024-01050-8
UR  - https://m2.mtmt.hu/api/publication/34822769
ID  - 34822769
AB  - Let [a,b]\subseteq \mathbb {R} [ a , b ] ⊆ R be a non-empty and non singleton closed interval and P=\{a=x_0<\cdots <x_n=b\} P = { a = x 0 < ⋯ < x n = b } is a partition of it. Then f:I\rightarrow \mathbb {R} f : I → R is said to be a function of r -bounded variation, if the expression \sum \nolimits ^{n}_{i=1}|f(x_i)-f(x_{i-1})|^{r} ∑ i = 1 n | f ( x i ) - f ( x i - 1 ) | r is bounded for all possible partitions like P . One of the main results of the paper deals with the generalization of the classical Jordan decomposition theorem. We establish that for r\in ]0,1] r ∈ ] 0 , 1 ] , a function of r -bounded variation can be written as the difference of two monotone functions. While for r>1 r > 1 , under minimal assumptions such a function can be treated as an approximately monotone function which can be closely approximated by a nondecreasing majorant. We also prove that for 0<r_1<r_2 0 < r 1 < r 2 , the function class of r_1 r 1 -bounded variation is contained in the class of functions satisfying r_2 r 2 -bounded variations. We go through approximately monotone functions and present a possible decomposition for f:I(\subseteq \mathbb {R}_+)\rightarrow \mathbb {R} f : I ( ⊆ R + ) → R satisfying the functional inequality f(x)\le f(x)+(y-x)^{p}\quad (x,y\in I \text{ with } x<y \text{ and } p\in ]0,1[ ). f ( x ) ≤ f ( x ) + ( y - x ) p ( x , y ∈ I with x < y and p ∈ ] 0 , 1 [ ) . A generalized structural study has also been done in that specific section. On the other hand, for \ell [a,b]\ge d ℓ [ a , b ] ≥ d , a function satisfying the following monotonic condition under the given assumption will be termed as d -periodically increasing f(x)\le f(y)\quad \text{ for } \text{ all }\quad x,y\in I\quad \text{ with }\quad y-x\ge d. f ( x ) ≤ f ( y ) for all x , y ∈ I with y - x ≥ d . We establish that in a compact interval any function satisfying d -bounded variation can be decomposed as the difference of a monotone and a d -periodically increasing function. The core details related to past results, motivation, structure of each and every section are thoroughly discussed below.
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Bujtás, Csilla
AU  - Rote, Günter
AU  - Tuza, Zsolt
TI  - Optimal strategies in fractional games: vertex cover and domination
JF  - ARS MATHEMATICA CONTEMPORANEA
J2  - ARS MATH CONTEMPOR
VL  - 2024
PY  - 2024
SN  - 1855-3966
DO  - 10.26493/1855-3974.2771.4df
UR  - https://m2.mtmt.hu/api/publication/34820138
ID  - 34820138
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Patkós, Balázs
AU  - Tuza, Zsolt
AU  - Vizer, Máté
TI  - Extremal Graph Theoretic Questions for q-Ary Vectors
JF  - GRAPHS AND COMBINATORICS
J2  - GRAPH COMBINATOR
VL  - 40
PY  - 2024
IS  - 3
PG  - 21
SN  - 0911-0119
DO  - 10.1007/s00373-024-02787-4
UR  - https://m2.mtmt.hu/api/publication/34818984
ID  - 34818984
N1  - Export Date: 3 May 2024            
            Correspondence Address: Vizer, M.; Department of Computer Science and Information Theory, Hungary; email: vizermate@gmail.com
AB  - A q -graph H on n vertices is a set of vectors of length n with all entries from \{0,1,\dots ,q\} { 0 , 1 , ⋯ , q } and every vector (that we call a q -edge) having exactly two non-zero entries. The support of a q -edge {\textbf{x}} x is the pair S_{\textbf{x}} S x of indices of non-zero entries. We say that H is an s -copy of an ordinary graph F if |H|=|E(F)| | H | = | E ( F ) | , F is isomorphic to the graph with edge set \{S_{\textbf{x}}:{\textbf{x}}\in H\} { S x : x ∈ H } , and whenever v\in e,e'\in E(F) v ∈ e , e ′ ∈ E ( F ) , the entries with index corresponding to v in the q -edges corresponding to e and e' e ′ sum up to at least s . E.g., the q -edges (1, 3, 0, 0, 0), (0, 1, 0, 0, 3), and (3, 0, 0, 0, 1) form a 4-triangle. The Turán number \mathop {}\!\textrm{ex}(n,F,q,s) ex ( n , F , q , s ) is the maximum number of q -edges that a q -graph H on n vertices can have if it does not contain any s -copies of F . In the present paper, we determine the asymptotics of \mathop {}\!\textrm{ex}(n,F,q,q+1) ex ( n , F , q , q + 1 ) for many graphs F .
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Guzsvinecz, Tibor
AU  - Szűcs, Judit
AU  - Perge, Erika
TI  - Examination of Accurate Exocentric Distance Estimates in a Virtual Environment Using a Desktop Display and the Gear VR
JF  - ELECTRONICS (SWITZ)
VL  - 13
PY  - 2024
IS  - 8
SP  - 1
EP  - 23
PG  - 23
SN  - 2079-9292
DO  - 10.3390/electronics13081536
UR  - https://m2.mtmt.hu/api/publication/34798546
ID  - 34798546
AB  - Spatial perception plays a critical role in virtual worlds and real environments, as it can impact navigation abilities. To understand this influence, the conducted study investigated the effects of human characteristics and immersion levels on the exocentric distance estimation process in virtual environments. As the first step, a virtual environment was implemented for both desktop and Gear VR head-mounted displays. Afterward, the exocentric distance estimation skills of 229 university students were examined. Out of these students, 157 used the desktop display, and 72 used the Gear VR. Using logistic regression analysis and linear regression analysis methods, their effects on the probabilities of accurate estimates and their estimation times were investigated. According to the results, gender, video game playtime per week, height, and display device had significant effects on the former, whereas dominant hand, video game playtime per week, height, and display device had significant effects on the latter. The results also show that by using the head-mounted display, the likelihood of the students estimating exocentric distances accurately significantly decreased; however, they were significantly faster with it. These findings can influence the development of more accessible and effective virtual environments in the future.
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Wang, Zeyu
AU  - Juhász, Zoltán
ED  - Zeinalipour, Demetris
ED  - Blanco Heras, Dora
ED  - Pallis, George
ED  - Herodotou, Herodotos
ED  - Trihinas, Demetris
ED  - Balouek, Daniel
ED  - Diehl, Patrick
ED  - Cojean, Terry
ED  - Fürlinger, Karl
ED  - Kirkeby, Maja Hanne
ED  - Nardellli, Matteo
ED  - Di Sanzo, Pierangelo
TI  - Massively Parallel EEG Algorithms for Pre-exascale Architectures
T2  - Euro-Par 2023: Parallel Processing Workshops
PB  - Springer Nature Switzerland
CY  - Cham
SN  - 9783031488030
T3  - Lecture Notes in Computer Science, ISSN 0302-9743 ; 14352.
PY  - 2024
SP  - 290
EP  - 295
PG  - 6
DO  - 10.1007/978-3-031-48803-0_34
UR  - https://m2.mtmt.hu/api/publication/34797365
ID  - 34797365
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Pituk, Mihály
AU  - Stavroulakis, John Ioannis
TI  - Characterization of shadowing for linear autonomous delay differential equations
JF  - CZECHOSLOVAK MATHEMATICAL JOURNAL
J2  - CZECH MATH J
VL  - 2024
PY  - 2024
SP  - 1
EP  - 8
PG  - 8
SN  - 0011-4642
DO  - 10.21136/CMJ.2024.0191-23
UR  - https://m2.mtmt.hu/api/publication/34780182
ID  - 34780182
LA  - English
DB  - MTMT
ER  -