359 research outputs found
On permutation trinomials of type x2ps+r+xps+r+λxr
We determine all permutation trinomials of type x(2ps+r) + x(ps+r) + lambda x(r) over the finite field F-pt when (2p(s) + r)(4) < p(t). This partially extends a previous result by Bhattacharya and Sarkar in the case p = 2, r = 1. (C) 2017 Elsevier Inc. All rights reserved
Quotients of the Hermitian curve from subgroups of PGU(3,q) without fixed points or triangles
In this paper, we deal with the problem of classifying the genera of quotient curves Hq/G, where Hq is the Fq2 -maximal Hermitian curve and G is an automorphism group of Hq. The groups G considered in the literature fix either a point or a triangle in the plane PG(2, q6). In this paper, we give a complete list of genera of quotients Hq /G, when G ≤ Aut(Hq) ∼= PGU(3,q) does not leave invariant any point or triangle in the plane. Also, the classification of subgroups G of PGU(3,q) satisfying this property is given up to isomorphism
Mario Signore, Giovanni Scarafile (a cura di): Libertà e persona
Nel testo si affrontano le questioni filosofico giuridiche inerenti ai temi della libertà e della persona, sia sotto il profilo giuridico che filosofico in un'ottica di riconoscimento ontologico della struttura personale dei limiti giuridici.The text deals with the philosophical juridical questions inherent to the themes of freedom and of the person, both from a juridical and philosophical point of view with a view to the ontological recognition of the personal structure of juridical limits
Complete (k,3)-arcs from quartic curves
Complete (k, 3)-arcs in projective planes over finite fields are the geometric counterpart of linear non-extendible Near MDS codes of length k and dimension 3. A class of infinite families of complete (k, 3)-arcs in PG(2, q) is constructed, for q a power of an odd prime p equivalent to 2(mod 3). The order of magnitude of k is smaller than q. This property significantly distinguishes the complete (k, 3)-arcs of this paper from the previously known infinite families, whose size differs from q by at most 2 root q
Structured Multi-class Feature Selection for Effective Face Recognition
This paper addresses the problem of real time face recognition in unconstrained environments from the analysis of low quality video frames. It focuses in particular on finding an effective and fast to compute (that is, sparse) representation of faces, starting from classical Local Binary Patterns (LBPs). The two contributions of the paper are a new formulation of Group LASSO for structured feature selection (MCGroup LASSO) to cope directly with multi-class settings, and a face recognition pipeline based on a representation derived from MC-GrpLASSO. We present an extensive experimental analysis on two benchmark datasets, MOBO and Choke Point, and on a more complex dataset acquired in-house over a large temporal span. We compare our results with state-of-the-art approaches and show the superiority of our method in terms of both performances and sparseness of the obtained solution
sj-doc-1-ine-10.1177_15910199221086429 - Supplemental material for Benefit from successful recanalization in an Italian cohort of stroke patients receiving endovascular treatments according to the DIRECT-MT trial criteria
Supplemental material, sj-doc-1-ine-10.1177_15910199221086429 for Benefit from successful recanalization in an Italian cohort of stroke patients receiving endovascular treatments according to the DIRECT-MT trial criteria by Manuel Cappellari, Valentina Saia, Giovanni Pracucci, Fabrizio Sallustio, Andrea Zini, Mauro Bergui, Cecilia Zivelonghi, Salvatore Mangiafico and Danilo Toni in Interventional Neuroradiology</p
On certain linearized polynomials with high degree and kernel of small dimension
Let be the -linear map over defined by with . It is known that the kernel of has dimension at most , as proved by Csajb'ok et al. in ``A new family of MRD-codes'' (2018).
For big enough, e.g. when , we classify the values of such that the kernel of has dimension at most .
To this aim, we translate the problem into the study of some algebraic curves of small degree with respect to the degree of ; this allows to use intersection theory and function field theory together with the Hasse-Weil bound.
Our result implies a non-scatteredness result for certain high degree scattered binomials, and the asymptotic classification of a family of rank metric codes
On maximal curves that are not quotients of the Hermitian curve
For each prime power l the plane curve Xlwith equation Yl2l+1=Xl2-X is maximal over Fl6. Garcia and Stichtenoth in 2006 proved that X3is not Galois covered by the Hermitian curve and raised the same question for Xlwith l>3; in this paper we show that Xlis not Galois covered by the Hermitian curve for any l>3. Analogously, Duursma and Mak proved that the generalized GK curve Clnover Fl2nis not a quotient of the Hermitian curve for l>2 and n≥5, leaving the case l=2 open; here we show that C2nis not Galois covered by the Hermitian curve over F22nfor n≥5
On monomial generalized almost perfect nonlinear functions
Generalized almost perfect nonlinear (GAPN) functions are a generalization of APN functions to finite fields of odd characteristic p introduced in 2017 by Kuroda and Tsujie. In this paper we deal with GAPN functions of monomial type. To this aim, we connect the GAPN property for a monomial function over Fpjavax.xml.bind.JAXBElement@7f2e9ed8 to the existence of suitable rational points of an algebraic curve defined over Fpjavax.xml.bind.JAXBElement@425705. We give necessary conditions for a monomial function to be GAPN, providing the converse of recent results by Özbudak and Sălăgean and by Zha, Hu and Zhang
Weierstrass semigroups at every point of the Suzuki curve
We explicitly determine the structure of the Weierstrass semigroups H(P) for any point P of the Suzuki curve Sq. As the point P varies, exactly two possibilities arise for H(P): one for the Fq-rational points (already known in the literature), and one for all remaining points. For this last case the minimal set of generators of H(P) is also provided. As an application, we construct dual one-point codes from an Fq4∖Fq-point whose parameters are better in some cases than the ones constructed in a similar way from an Fq-rational point
- …
