Zobrazeno 1 - 10
of 109
pro vyhledávání: '"József Solymosi"'
Publikováno v:
Discrete Analysis (2018)
Rank bounds for design matrices with block entries and geometric applications, Discrete Analysis 2018:5, 24 pp. It is not hard to prove, when the statement is suitably formulated, that if $A$ is a random matrix, then it is not possible to reduce the
Externí odkaz:
https://doaj.org/article/5d3c3a1144da4c2ba2fabad757c1758f
Autor:
József Solymosi, Endre Szabó
Publikováno v:
Linear Algebra and its Applications. 668:161-172
Autor:
Máté Solymosi, Tibor Bujtás, József Csurgai, Andor Marusa, Gábor Nagy, József Solymosi, Ottó Zsille
Publikováno v:
Radiation Protection Dosimetry. 199:843-848
Lifting the control rod sleeves (CRS) is one of the initial steps of the refuelling of the VVER-400-213 type reactor, which are operating at Paks NPP. If any fuel-cassette adheres to the CRS during its lift, it can result in unplanned exposure of the
Publikováno v:
Discrete & Computational Geometry. 69:232-249
We study arrangements of intervals in $\mathbb{R}^2$ for which many pairs form trapezoids. We show that any set of intervals forming many trapezoids must have underlying algebraic structure, which we characterise. This leads to some unexpected exampl
Publikováno v:
Hadmérnök. 17:147-158
Based on the information gathered within the technologies review performed in the previous article, the authors analyse if the deferent technologies could efficiently (or not) support the excavation work to be performed for the remediation of industr
Publikováno v:
Hadmérnök. 17:155-170
In the last 10 years, the technological developments have changed the paradigm in remote sensing science. Nowadays, very diverse technologies can be employed to capture and/or extract very accurate terrain elevation data and prepare digital elevation
Autor:
József Solymosi, Ethan Patrick White
Publikováno v:
Discrete & Computational Geometry.
Autor:
József Solymosi, Ching Wong
Publikováno v:
Studia Scientiarum Mathematicarum Hungarica. 59:30-39
Two hexagons in the space are said to intersect heavily if their intersection consists of at least one common vertex as well as an interior point. We show that the number of hexagons on n points in 3-space without heavy intersections is o(n2), under
Autor:
József Solymosi, Йoжeф Шoймoши
Publikováno v:
Trudy Matematicheskogo Instituta imeni V.A. Steklova. 314:338-345
Доказано обобщение леммы Туэ-Виноградова. Полученные результаты представляют собой еще один пример применения полиномиального метода,
Autor:
József Solymosi
Publikováno v:
Proceedings of the Steklov Institute of Mathematics. 314:325-331
We prove an extension of the Thue–Vinogradov lemma. This paper is another example for the application of the polynomial method, Redei polynomials, and Stepanov’s technique.