1,219,568 research outputs found
Notes on low degree L-data
No full textThese notes are an extended version of a talk given by the author at the conference Analytic Number Theory and Related Areas held at Research Institute for Mathematical Sciences, Kyoto University in November 2015. We are interested in L‐data, an axiomatic framework for L\sim‐functions introduced by Andrew Booker in 2013 [3]. Associated to each L‐datum, one has a real number invariant known as the degree. Conjecturally the degree d is an integer, and if d\in \mathrm{N} then the L‐datum is that of a
mathrm{G}\mathrm{L}_{n}(\mathrm{A}_{F}) ‐automorphic
representation for n\in \mathrm{N} and a number field F (if F=\mathbb{Q} , then n=d This statement was shown to be true for 0\displaystyle \leq d<\frac{5}{3} by Booker in his pioneering paper [3], and in these notes we consider an extension of his methods to 0\leq d<2. This is simultaneously a generalisation of Booker’s result and the results and techniques of Kaczorowski‐Pereli in the Selberg class
[10]. Furthermore, we consider applications to zeros of automorphic L-‐functions. In these notes we review Booker’s results and announce new ones to appear elsewhere shortly
Symbol-Flipping Based Decoding of Generalized Low-Density Parity-Check Coded Constructed over GF(q)
No full textAn efficient symbol-flipping based decoding algorithm designed for nonbinary Generalized Low-Density Parity-Check (GLDPC) codes is proposed. By extending the concept of the Weighted Bit Flip Voting (WBFV) algorithm designed for binary Hamming-code based GLDPC codes, the symbol-flipping decoding algorithm can be beneficially employed for decoding the family of GLDPC codes constructed from nonbinary constituent codes, such as nonbinary Bose Chaudhuri Hocquenghem (BCH) codes or Reed Solomon (RS) codes. The simulation results demonstrate that improvements of 1 dB and 2.7 dB are achieved by the proposed coding scheme in comparison to the more conventional binary GLDPC codes using the WBFV decoding algorithm, when using the Galois Field GF(32) for communicating over AWGN and uncorrelated Rayleigh fading channels, respectively
Erratum to: Effect of moderate red wine intake on cardiac prognosis after recent acute myocardial infarction of subjects with Type 2 diabetes mellitus (Diabetic Medicine, (2006), 23, 9, (974-981), 10.1111/j.1464-5491.2006.01886.x)
No full textIn an article by Marfella et al, the author name C. Saron is incorrect and should be listed as C. Sardu. Therefore the correct author list is: R. Marfella, F. Cacciapuoti, M. Siniscalchi, F. C. Sasso, F. Marchese, F. Cinone, E. Musacchio, M. A. Marfella, L. Ruggiero, G. Chiorazzo, D. Liberti, G. Chiorazzo, G. F. Nicoletti, C. Sardu, F. D'Andrea, C. Ammendola, M. Verza and L. Coppola.In an article by Marfella et al, the author name C. Saron is incorrect and should be listed as C. Sardu. Therefore the correct author list is: R. Marfella, F. Cacciapuoti, M. Siniscalchi, F. C. Sasso, F. Marchese, F. Cinone, E. Musacchio, M. A. Marfella, L. Ruggiero, G. Chiorazzo, D. Liberti, G. Chiorazzo, G. F. Nicoletti, C. Sardu, F. D'Andrea, C. Ammendola, M. Verza and L. Coppola
Sous-facteurs de L(F∞) d'indice 4cos2π/n,n≥3
No full textLet Q be a factor of type II1, λ a number in the Jones discrete series {4cosπ/m:m≥3}, and {ei} the Jones projections associated with λ. Denote by A2n and A1n the finite-dimensional von Neumann algebras generated, respectively, by {1,e2,⋯,en} and {1,e1,⋯,en}, with the corresponding traces. The author shows that, for n sufficiently large, the index of the inclusion An=(Q⊗A2n)∗A2nA1n⊂(Q⊗A2n+1)∗A2n+1A1n+1=An+1 is equal to λ (here ∗ denotes the reduced, amalgamated free product of the algebras in question). Using the random matrix model of Voiculescu, he proves that if Q is the von Neumann algebra L(F∞) of the free group with infinitely many generators, then An is isomorphic to L(F∞).
The two facts together imply the existence, for any λ in the Jones discrete series, of an irreducible subfactor of L(F∞) of index λ. This constitutes the first example of a nonhyperfinite, non-Γ II1 factor such that its Jones invariant is fully computable (the existence of nonirreducible subfactors of L(F∞) for any index ≥4 is a simple consequence of known results)
A model for F-L and R=F-L/F-T at low x and low Q(2)
No full textA model for the longitudinal structure function F-L at low x and low Q(2) is presented, which includes the kinematical constraint F-L similar to Q(4) as Q(2) --> 0. It is based on the photon-gluon fusion mechanism suitably extrapolated to the region of lo</p
Reliability-Ratio Based Weighted Bit-Flipping Decoding for Low-Density Parity Check Codes
No full textA novel reliability ratio based weighted bit-flipping decoding scheme is proposed for low-density parity-check codes. A coding gain of 1 dB is achieved in comparison to the weighted bit-flipping scheme, when communicating over an AWGN channel, while maintaining the same decoding complexity
Politica e amministrazione, tra etica, managerialità e responsabilità
No full textIl volume raccoglie le versioni, approfondite e rielaborate, delle relazioni discusse in occasione del convegno dal titolo “Politica e amministrazione. Etica, managerialità e responsabilità”, organizzato in onore di Gianfranco D’Alessio. L’oggetto di analisi, la dirigenza amministrativa, è discusso e analizzato, da un lato, in relazione ai principi costituzionali di imparzialità e di buon andamento della Pubblica Amministrazione e, dall’altro, al rapporto che questa instaura con gli organi politici. Il tema è affrontato con approcci variegati e da prospettive molteplici, secondo una impostazione che riflette la pluralità delle competenze e delle esperienze, professionali ed accademiche di ciascun autore.The volume collects the expanded and revised versions of the presentations discussed during the conference titled "Politics and Administration. Ethics, Managerialism, and Accountability," organized in honour of Gianfranco D’Alessio. The focus is on administrative leadership, discussed and analysed from two perspectives. Firstly, in relation to the constitutional principles of impartiality and good administration. Secondly, with reference to the relationship it establishes with political bodies. The topic is approached from various angles and multiple perspectives, reflecting the diversity of skills and experiences, both professional and academic, of each author
Low-Complexity Non-Binary LDPC and Modulation Schemes communicating over MIMO Channels
No full textIn this contribution, Pearl’s belief propagation (BP) algorithm is invoked for constructing a belief network, which is employed for developing a joint detection aided transmit diversity scheme and a non-binary LDPC decoder constructed over a finite field of GF(q). An exciting bit-by-bit detection scheme is further developed for creating the joint purly symbol-based LDPC/transmit diversity decoder. The performance of the proposed symbol-based system is benchmarked against the original bit-by-bit detection scheme, when communicating over an uncorrelated Rayleigh fading channel using two transmitters and two receivers. The associated detection complexities are also compared
The 2D/3D dynamics of wall-bounded low-Rm magnetohydrodynamic (MHD) turbulence
No full textWith this experimental study, we give evidence that the dynamics of low-Rm MHD turbulence depends on the diffusion length l_z, which corresponds to the distance over which the Lorentz force is able to diffuse momentum before it is balanced by inertia
Reliability Ratio Based Weighted Bit-Flipping Decoding for LDPC Codes
No full textIn this contribution, a novel reliability-ratio based weighted bit-flipping(RRWBF) algorithm is proposed for decoding Low Density Parity Check (LDPC) codes. The RRWBF algorithm proposed is benchmarked against the conventional weighted bit-flipping (WBF) algorithm [1] and the improved weighted bit-flipping (IWBF) algorithm [2]. More than 1 and 2 dB coding gain was achieved at an BER of 10-5 while invoking the RRWBF algorithm in comparison to the two benchmarking schemes, when communicating over an AWGN and an uncorrelated Rayleigh channel, respectively. Furthermore, the decoding complexity of the proposed RRWBF algorithm is maintained at the same level as that of the conventional WBF algorithm
- …
