Let X be a projective geometrically irreducible non-singular algebraic curve defined over a finite field Fq2 of order q . If the number of Fq2 -rational points of X satisfies the Hasse-Weil upper bound, then X is said to be Fq2 -maximal. For a point P0 ∈ X (Fq2 ), let π be the morphism arising from the linear series D := |(q + 1)P0|, and let N := dim(D). It is known that N ≥ 2 and that π is ind...

We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and then have a closer look at the temporal evolution of the degrees of individual vertices, which we describe in terms of large and moderate deviation principle...

Let C be a curve of genus 2 and ψ1 : C −→ E1 a map of degree n, from C to an elliptic curve E1, both curves defined over C. This map induces a degree n map φ1 : P 1 −→ P 1 which we call a Frey-Kani covering. We determine all possible ramifications for φ1. If ψ1 : C −→ E1 is maximal then there exists a maximal map ψ2 : C −→ E2, of degree n, to some elliptic curve E2 such that there is an isogeny...

Fifty patients underwent an objective measurement of physical working capacity by means of a multistage test of maximally tolerated exertion before and after coronary bypass surgery; 29 patients also had haemodynamic measurements during maximal exercise before and after coronary bypass surgery. The patients were divided into 3 groups according to the degree of revascularisation: adequate (n = 2...

We prove that there are exactly six normal CM-fields of degree 32 with class number one. Five of them are composita of two normal CM-fields of degree 16 with the same maximal totally real octic field.

We study algebraic degree profile of reduced-round block cipher schemes. We show that the degree is not maximal with elementary combinatorial and algebraic arguments. We discuss on how it can be turned into distinguishers from balanced random functions.

BACKGROUND Aerobic power declines with age. The degree to which this decline is reversible remains unclear. In a 30-year longitudinal follow-up study, the cardiovascular adaptations to exercise training in 5 middle-aged men previously trained in 1966 were evaluated to assess the degree to which the age-associated decline in aerobic power is attributable to deconditioning and to gain insight int...

Let D=(V,A) be a digraphs without isolated vertices. The first Zagreb index of digraph D is defined as summation over all arcs, M1(D)=12∑uv∈A(du++dv−), where du+(resp. du−) denotes the out-degree (resp. in-degree) vertex u. In this paper, we give maximal values and set orientations unicyclic graphs with n vertices matching number m (2≤m≤⌊n2⌋).

We address the question of attaining stability guarantees through distributed scheduling in wireless networks. We consider a simple, local information based, distributed scheduling strategy, maximal scheduling, and prove that it attains a guaranteed fraction of the maximum stability region. By considering the notion of queue-length stability, we strengthen existing rate stability results for ma...