We consider Erd˝ os-Ko-Rado sets of generators in classical finite polar spaces. These are sets of generators that all intersect non-trivially. We characterize the Erd˝ os-Ko-Rado sets of generators of maximum size in all polar spaces, except for H(4n + 1, q 2) with n ≥ 2.
Using geometric properties of the variety Vr,t, the image under the Grassmannian map of a Desarguesian (t − 1)-spread of PG (rt − 1, q), we introduce error correcting codes related to the twisted tensor product construction, producing several families of constacyclic codes. We exactly determine the parameters of these codes and characterise the words of… (More)
In , the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterised. Inspired by this result, using geometrical arguments, we characterise the codewords of small weight in the dual code of the code of points and generators of Q + (5, q) and H(5, q 2), and we present lower bounds on the weight of the codewords… (More)
Amongst the contributions to the theory of LDPC codes deriving from finite geometries (, , ), we present a study of the code C which has as parity-check matrix H the incidence matrix of the Hermitian curve of P G(2, q 2) and the q + 1-secant to it. The good performance of C with iterative decoding algorithm is showed by Johnson and Weller in… (More)
We show that there are graphs with n vertices containing no K 5,5 which have about 1 2 n 7/4 edges, thus proving that ex(n, K 5,5) ≥ 1 2 (1 + o(1))n 7/4. This bound gives an asymptotic improvement to the known lower bounds on ex(n, K t,s) for t = 5 when 5 ≤ s ≤ 12, and t = 6 when 6 ≤ s ≤ 8.
In , the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterized. Using geometrical arguments , we characterize the codewords of small weight in the dual code of the code of points and generators of Q + (5, q) and H(5, q 2). For the dual codes of the codes of Q + (5, q), q even, and Q(4, q), q even, we… (More)
We show that the norm graph constructed in  with n vertices about 1 2 n 2−1/t edges, which contains no copy of K t,(t−1)!+1 , does not contain a copy of K t+1,(t−1)!−1 .
The aim of this report is to analyze the clinical symptoms, ethologic factors, and prosthetic rehabilitation in a case of Combination Syndrome (CS). The treatment of CS can be conventional or surgical, with or without the bone reconstruction of maxilla. The correct prosthetic treatment helps this kind of patients to restore the physiologic occlusion plane… (More)