AbstractOne of the crucial problem about caps is to determine the spectrum of the values of k for which there exists a complete k-cap. In this paper a class of small complete k-caps is constructed in PG(3,q),q=3n, n>1, such that k=(q2+6)/3; these are smaller than those currently known in characteristic three
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
In this work, we are interested in a nonlinear PDE of the form: −∆u = K(x)u n+2 n−2 , u > 0 on Ω and...
AbstractIn this paper we present a general method to construct caps in higher-dimensional projective...
AbstractThe smallest known complete caps in PG(n,2) have size 23(2(n−6)/2)−3 if n≥10 is even and siz...
AbstractIn 1959, Segre constructed a complete (3q+2)-cap inPG(3, q),qeven. This showed that the size...
AbstractWe construct a cap Cn in PG(n,4) of size 12(2n−2−1)+5. In the cases when n=3 and 4, this yie...
Let C be a circle divided into n parts equally. The set of the ends of these parts on C are denoted ...
Caps K of PG(3, q) with properties (1) and (2) have been studied in [1, 2, 3]. The Segre estimate fo...
AbstractAny permutation of a finite field Fq can be represented by a polynomial Pn(x)=(⋯+((a0x+a1)q−...
AbstractFor integers p,q,s with p⩾q⩾2 and s⩾0, let K2−s(p,q) denote the set of 2-connected bipartite...
AbstractWe prove that in PG(3,q), q>19, a partial flock of a quadratic cone with q-ɛ planes, can be ...
We explore some questions related to one of Brizolis: does every prime p have a pair (g,h) such that...
AbstractFor q odd, we extend the known construction of Fisher–Thas–Walker flocks via the osculating ...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
AbstractThe trees of order n≥15 and algebraic connectivity no less than 2-3 have been recently class...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
In this work, we are interested in a nonlinear PDE of the form: −∆u = K(x)u n+2 n−2 , u > 0 on Ω and...
AbstractIn this paper we present a general method to construct caps in higher-dimensional projective...
AbstractThe smallest known complete caps in PG(n,2) have size 23(2(n−6)/2)−3 if n≥10 is even and siz...
AbstractIn 1959, Segre constructed a complete (3q+2)-cap inPG(3, q),qeven. This showed that the size...
AbstractWe construct a cap Cn in PG(n,4) of size 12(2n−2−1)+5. In the cases when n=3 and 4, this yie...
Let C be a circle divided into n parts equally. The set of the ends of these parts on C are denoted ...
Caps K of PG(3, q) with properties (1) and (2) have been studied in [1, 2, 3]. The Segre estimate fo...
AbstractAny permutation of a finite field Fq can be represented by a polynomial Pn(x)=(⋯+((a0x+a1)q−...
AbstractFor integers p,q,s with p⩾q⩾2 and s⩾0, let K2−s(p,q) denote the set of 2-connected bipartite...
AbstractWe prove that in PG(3,q), q>19, a partial flock of a quadratic cone with q-ɛ planes, can be ...
We explore some questions related to one of Brizolis: does every prime p have a pair (g,h) such that...
AbstractFor q odd, we extend the known construction of Fisher–Thas–Walker flocks via the osculating ...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
AbstractThe trees of order n≥15 and algebraic connectivity no less than 2-3 have been recently class...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
In this work, we are interested in a nonlinear PDE of the form: −∆u = K(x)u n+2 n−2 , u > 0 on Ω and...
AbstractIn this paper we present a general method to construct caps in higher-dimensional projective...