Linear codes associated to skew-symmetric determinantal varieties

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given.     

New lower bounds on the size of (n,r)‐arcs in PG(2,q)

An $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ is a set of $n$ points such that each line contains at most $r$ of the selected points. It is well known that $\left(n,r\right)$‐arcs in $\text{PG}\left(2,q\right)$ correspond to projective linear codes. Let $m_r\left(2,q\right)$ denote the maximal number $n$ of points for which an $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ exists. In this paper we obtain improved lower bounds on $m_r\left(2,q\right)$ by explicitly constructing $\left(n,r\right)$‐arcs. Some of the constructed $\left(n,r\right)$‐arcs correspond to linear codes meeting the Griesmer bound. All results are obtained by integer linear programming.     

Optimising the Termofluids CFD code for petascale simulations

ABSTRACT

This paper presents some recent efforts carried out on the expansion of the scalability of TermoFluids multi-physics Computational Fluid Dynamics (CFD) code, aiming to achieve petascale capacity for a single simulation. We describe different aspects that we have improved in our code in order to efficiently run it on 131,072 CPU-cores. This work has been developed using the BlueGene/Q Mira supercomputer of the Argonne Leadership Computing Facility, where we have obtained feedback at the targeted scale. In summary, this is a practical paper showing our experience at reaching the petascale paradigm for a single simulation with TermoFluids.     

半度量空间的刻画

We use the notions of weak base g-functions and pair networks to give some new characterizations of semi-metric spaces.     

Efficient implementation of restricted active space configuration interaction with the hole and particle approximation

The restricted active space configuration interaction (RASCI) formalism with the hole and particle truncation of the wavefunction, that is, RASCI(h,p), holds very nice properties such as balanced treatment of ground and low‐lying excited states, spin‐completeness, large flexibility of the wavefunction, and moderate computational cost. In this article, I present a new implementation of the RASCI(h,p) method using a general algorithm based on the integral‐driven approach. The new implementation allows to choose any electronic configuration as the single reference in combination with an excitation operator with any number of ionization, electron attachment, or spin‐flip (SF) excitations. The applicability and good performance of the new computational code is tested in the ground state calculation of water molecule with increasingly large active spaces and up to the full‐CI limit, the calculation of all‐trans linear polyenes with variable number of SF excitations, and the low‐lying states of fluorine molecule with a double‐ionization potential operator. © 2012 Wiley Periodicals, Inc.     

Flexizyme‐Mediated Genetic Reprogramming As a Tool for Noncanonical Peptide Synthesis and Drug Discovery

Noncanonical peptides occur frequently in Nature, and often display high bioactivity. However, the lack of tractable systems for the synthesis of diverse libraries of such peptides has thus far hampered their development as drugs. Genetic reprogramming techniques, in which noncanonical amino acids may be incorporated into peptides, have largely removed this limitation. This Concept article outlines the development of these techniques with an emphasis on drug discovery.     

Factoriality for the reductive Zassenhaus variety and quantum enveloping algebra

Let U(g)$U(\mathfrak{g})$ be the enveloping algebra of a finite dimensional reductive Lie algebra g$\mathfrak{g}$ over an algebraically closed field of prime characteristic. Let _U?,P(s:)$U_{?,P}(\mathfrak{s}:)$ be the simply connected quantum enveloping algebra at the root of unity ?  , of a complex semi-simple finite dimensional Lie algebra s:$\mathfrak{s}:$. We show, by similar proofs, that the centers of both are factorial. While the first result was established by R. Tange [32] (by different methods), the second one confirms a conjecture in [4]. We also provide a general criterion for the factoriality of the centers of enveloping algebras in prime characteristic.