Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Tamás Szőnyi is active.

Publication


Featured researches published by Tamás Szőnyi.


Geometriae Dedicata | 1985

Small complete arcs in Galois planes

Tamás Szőnyi

AbstractIn this paper we construct a class of k-arcs in PG(2, q), q=ph, h>1, p≠3 and prove its completeness for h large enough. The main result states that this class contains complete k-arcs with


Designs, Codes and Cryptography | 2003

On Maximal Partial Spreads in PG ( n , q )

András Gács; Tamás Szőnyi


Discrete Mathematics | 2001

Covers and blocking sets of classical generalized quadrangles

Jörg Eisfeld; Leo Storme; Tamás Szőnyi; Péter Sziklai

k \leqslant 2 \cdot q^{{9 \mathord{\left/ {\vphantom {9 {10}}} \right. \kern-\nulldelimiterspace} {10}}} {\text{ }}\left( {10{\text{ divides }}h{\text{ and }}q{\text{ }} \geqslant {\text{ }}q_{\text{0}} } \right).


Designs, Codes and Cryptography | 2008

Random constructions and density results

András Gács; Tamás Szőnyi


Journal of Geometry | 2011

On q-analogues and stability theorems

A Aart Blokhuis; Ae Andries Brouwer; Tamás Szőnyi; Zsuzsa Weiner

Such complete k-arcs are the unique known complete k-arcs with


Designs, Codes and Cryptography | 1996

On Cyclic Caps in Projective Spaces

Tamás Szőnyi


Discrete Mathematics | 1992

Note on the structure of semiovals in finite projective planes

A Aart Blokhuis; Tamás Szőnyi

k \leqslant {q \mathord{\left/ {\vphantom {q 4}} \right. \kern-\nulldelimiterspace} 4}.


Discrete Mathematics | 1999

Around Rédei's theorem

Tamás Szőnyi


Designs, Codes and Cryptography | 2003

On Sets without Tangents in Galois Planes of Even Order

A Aart Blokhuis; Tamás Szőnyi; Zsuzsa Weiner


Journal of Combinatorial Theory | 1993

Sets with a large number of nuclei on a conic

A Aart Blokhuis; Tamás Szőnyi

In this paper we construct maximal partial spreads in PG(3, q) which are a log q factor larger than the best known lower bound. For n ≥ 5 we also construct maximal partial spreads in PG(n, q) of each size between cnqn − 2 log q and c′ qn − 1.

Collaboration


Dive into the Tamás Szőnyi's collaboration.

Top Co-Authors

Avatar

A Aart Blokhuis

Eindhoven University of Technology

View shared research outputs
Top Co-Authors

Avatar

András Gács

Eötvös Loránd University

View shared research outputs
Top Co-Authors

Avatar

Zsuzsa Weiner

Eötvös Loránd University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Péter Sziklai

Eötvös Loránd University

View shared research outputs
Top Co-Authors

Avatar

Tamás Héger

Eötvös Loránd University

View shared research outputs
Top Co-Authors

Avatar

Ae Andries Brouwer

Eindhoven University of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Csaba Mengyán

Eötvös Loránd University

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge