Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 7
Izvirni znanstveni članek
Oznake: linear codes;PG(2, q);stability;
Stability of k mod p multisets and small weight codewords of the code generated by the lines of PG(2, q)
Leto: 2018 Vir: Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake: zgornje kromatično število;hipergraf;n-dimenzionalni projektivni prostor PG(n,q);upper chromatic number;hypergraph;n-dimensional projective space PG(n,q);
On the upper chromatic number and multiple blocking sets of PG(n,q)
Leto: 2020 Vir: Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake: Unital;Moulton plane;Hermitian;
We prove that every Moulton plane of odd order-by duality every generalised André plane-contains a unital. We conjecture that such unitals are non-classical, that is, they are not isomorphic, as designs, to the Hermitian unital. We prove our conjecture for Moulton planes which differ from PG(2, q2) ...
Leto: 2018 Vir: Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake: blokovne množice;Barove podravnice;relativne blokovske množice;blocking sets;Baer subplanes;relative blocking sets;fractional cover;fractional covering number;
Relative blocking sets of unions of Baer subplanes
Leto: 2019 Vir: Univerza na Primorskem (UP)
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake: finite field;affine space;integral distance;integral automorphism;
Integral automorphisms of affine spaces over finite fields
Leto: 2015 Vir: Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake: končna projektivna ravnina;lok;Hallova ravnina;finite projective plane;arc;Hall plane;
Inherited conics in Hall planes
Leto: 2019 Vir: Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake: projektiovne ravnine;uravnoteženo zgornje kromatično število;diferenčne množice;ravninske funkcije;verjetnostna metoda;projective planes;balanced upper chromatic number;difference sets;planar functions;probabilistic method;
In this paper, we study vertex colorings of hypergraphs in which all color class sizes differ by at most one (balanced colorings) and each hyperedge contains at least two vertices of the same color (rainbow-free colorings). For any hypergraph ▫$H$▫, the maximum number ▫$k$▫ for which there is a bala ...
Leto: 2021 Vir: Univerza na Primorskem (UP)
Št. zadetkov: 7
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: