Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Zsuzsa Weiner"'
Autor:
Tamás Szőnyi, Zsuzsa Weiner
Publikováno v:
FINITE FIELDS TH APP FINITE FIELDS AND THEIR APPLICATIONS.
Publikováno v:
Designs, Codes and Cryptography. 88:771-788
Let $C_{n-1}(n,q)$ be the code arising from the incidence of points and hyperplanes in the Desarguesian projective space PG($n,q$). Recently, Polverino and Zullo proved that within this code, all non-zero code words of weight at most $2q^{n-1}$ are s
Let $U$ be a set of polynomials of degree at most $k$ over $\mathbb{F}_q$, the finite field of $q$ elements. Assume that $U$ is an intersecting family, that is, the graphs of any two of the polynomials in $U$ share a common point. Adriaensen proved t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a50b9254bc7ba5fa75e5b7e503d9fdbe
Autor:
Zsuzsa Weiner, Bence Csajbók
In this paper, we generalize the so-called Korchmaros—Mazzocca arcs, that is, point sets of size q + t intersecting each line in 0, 2 or t points in a finite projective plane of order q. For t ≠ 2, this means that each point of the point set is i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e6932fae01e62fa4cc204d580ed0f00
http://hdl.handle.net/11589/234051
http://hdl.handle.net/11589/234051
Autor:
Zsuzsa Weiner, Tamás Szőnyi
Publikováno v:
European Journal of Combinatorics. 94:103314
A blocking set in a projective plane is a point set intersecting each line. The smallest blocking sets are lines. The second smallest minimal blocking sets are Baer subplanes (subplanes of order q ). Our aim is to study the stability of Baer subplane
Autor:
Zsuzsa Weiner, Tamás Szőnyi
In this paper, we prove a stability result on k mod p multisets of points in PG ( 2 , q ) , q = p h . The particular case k = 0 is used to describe small weight codewords of the code generated by the lines of PG ( 2 , q ) , as linear combination of f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aad9c29dce18c8a83bc1eda54f93dc8c
http://arxiv.org/abs/1901.09649
http://arxiv.org/abs/1901.09649
Autor:
Tamás Szőnyi, Zsuzsa Weiner
Publikováno v:
Advances in Mathematics. 267:381-394
A stability theorem says that a nearly extremal object can be obtained from an extremal one by “small changes”. In this paper, we prove a sharp stability theorem of sets of even type in PG ( 2 , q ) , q even. As a consequence, we improve Blokhuis
Autor:
Tamás Szőnyi, Zsuzsa Weiner
Publikováno v:
Journal of Algebraic Combinatorics. 40:279-292
A stability theorem says that a nearly extremal object can be obtained from an extremal one by "small changes". In this paper, we study the relation of sets having few 0-secants and blocking sets.
Publikováno v:
European Journal of Combinatorics
In 1967, Brown constructed small k-regular graphs of girth six as induced subgraphs of the incidence graph of a projective plane of order q, q>=k. Examining the construction method, we prove that starting from PG(2,q), q=p^h, p prime, there are no ot