Construction of Pooling Designs with Affine Symplectic Space

2015 ◽  
Author(s):  
Haixia Guo
Keyword(s):  
Symplectic Space ◽  
Pooling Designs

Constructing error-correcting pooling designs with symplectic space

2009 ◽  
Vol 20 (4) ◽  
pp. 413-421 ◽  
Author(s):  
Jun Guo ◽  
Yuexuan Wang ◽  
Suogang Gao ◽  
Jiangchen Yu ◽  
Weili Wu
Keyword(s):  
Symplectic Space ◽  
Pooling Designs

Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces

2019 ◽  
Vol 12 (05) ◽  
pp. 1950069
Author(s):  
Mahdieh Hakimi Poroch
Keyword(s):  
Sphere Packing ◽  
Symplectic Space ◽  
Isotropic Subspace ◽  
Subspace Codes ◽  
Singleton Bound ◽  
Symplectic Spaces ◽  
Isotropic Subspaces ◽  
Totally Isotropic Subspace ◽  
Totally Isotropic Subspaces

In this paper, we propose the Sphere-packing bound, Singleton bound and Gilbert–Varshamov bound on the subspace codes [Formula: see text] based on totally isotropic subspaces in symplectic space [Formula: see text] and on the subspace codes [Formula: see text] based on totally isotropic subspace in extended symplectic space [Formula: see text].

scholarly journals Pooling Designs for Outcomes under a Gaussian Random Effects Model

Biometrics ◽  
2011 ◽  
Vol 68 (1) ◽  
pp. 45-52 ◽  
Author(s):  
Yaakov Malinovsky ◽  
Paul S. Albert ◽  
Enrique F. Schisterman
Keyword(s):  
Random Effects ◽  
Random Effects Model ◽  
Pooling Designs

Efficient Error-Correcting Pooling Designs Constructed from Pseudo-Symplectic Spaces Over a Finite Field

2010 ◽  
Vol 17 (10) ◽  
pp. 1413-1423 ◽  
Author(s):  
Zengti Li ◽  
Suogang Gao ◽  
Hongjie Du ◽  
Feng Zou ◽  
Weili Wu
Keyword(s):  
Finite Field ◽  
Pooling Designs ◽  
Symplectic Spaces

Asymptotics of pooling design performance

1999 ◽  
Vol 36 (04) ◽  
pp. 951-964
Author(s):  
J. K. Percus ◽  
O. E. Percus ◽  
W. J. Bruno ◽  
D. C. Torney
Keyword(s):  
Group Testing ◽  
Performance Criterion ◽  
Expected Number ◽  
Pooling Design ◽  
Pooling Designs ◽  
Parametric Control ◽  
Expected Performance ◽  
Qualitative Effect ◽  
Pooling Strategy ◽  
Asymptotic Forms

We analyse the expected performance of various group testing, or pooling, designs. The context is that of identifying characterized clones in a large collection of clones. Here we choose as performance criterion the expected number of unresolved ‘negative’ clones, and we aim to minimize this quantity. Technically, long inclusion–exclusion summations are encountered which, aside from being computationally demanding, give little inkling of the qualitative effect of parametric control on the pooling strategy. We show that readily-interpreted re-summation can be performed, leading to asymptotic forms and systematic corrections. We apply our results to randomized designs, illustrating how they might be implemented for approximating combinatorial formulae.

Chiral strings, topological branes, and a generalised Weyl-invariance

2019 ◽  
Vol 34 (06n07) ◽  
pp. 1950031 ◽  
Author(s):  
Alex S. Arvanitakis
Keyword(s):  
Field Theory ◽  
Sigma Model ◽  
Space Time ◽  
Symplectic Space ◽  
Topological Field Theory ◽  
Brst Operator ◽  
Weyl Invariance ◽  
Fixed Action ◽  
Twistor Strings ◽  
Topological Field

We introduce a sigma model Lagrangian generalising a number of new and old models which can be thought of as chiral, including the Schild string, ambitwistor strings, and the recently introduced tensionless AdS twistor strings. This “chiral sigma model” describes maps from a [Formula: see text]-brane worldvolume into a symplectic space and is manifestly invariant under diffeomorphisms as well as under a “generalised Weyl invariance” acting on space–time coordinates and worldvolume fields simultaneously. Construction of the Batalin–Vilkovisky master action leads to a BRST operator under which the gauge-fixed action is BRST-exact; we discuss whether this implies that the chiral brane sigma model defines a topological field theory.

Sign in / Sign up

Export Citation Format

Share Document