Torified varieties and their geometries over {\mathbb{F}_1}

This paper invents the notion of torified varieties: A torification of a scheme is a decomposition of the scheme into split tori. A torified variety is a reduced scheme of finite type over ${\mathbb Z}$ that admits a torification. Toric varieties, split Chevalley schemes and flag varieties are examples of this type of scheme. Given a torified variety whose torification is compatible with an affine open covering, we construct a gadget in the sense of Connes?CConsani and an object in the sense of Soulé and show that both are varieties over ${\mathbb{F}_1}$ in the corresponding notion. Since toric varieties and split Chevalley schemes satisfy the compatibility condition, we shed new light on all examples of varieties over ${\mathbb{F}_1}$ in the literature so far. Furthermore, we compare Connes?CConsani??s geometry, Soulé??s geometry and Deitmar??s geometry, and we discuss to what extent Chevalley groups can be realized as group objects over ${\mathbb{F}_1}$ in the given categories.     

NONVANISHING OF CONFORMAL BLOCKS DIVISORS ON $$ {\overline{\mathrm{M}}}_{0,n} $$

We introduce and study the problem of finding necessary and sufficient conditions under which a conformal blocks divisor on \( {\overline{\mathrm{M}}}_{0,n} \) is nonzero, solving the problem completely for \( \mathfrak{s}{\mathfrak{l}}_2 \). We give necessary nonvanishing conditions in type A, which are sufficient when theta and critical levels coincide. We also show divisors are subject to additive identities, reflecting a decomposition of the weights and level.     

Maximum distance separable codes over {\mathbb{Z}_4} and {\mathbb{Z}_2 \times \mathbb{Z}_4}

Known upper bounds on the minimum distance of codes over rings are applied to the case of ${\mathbb Z_{2}\mathbb Z_{4}}$ -additive codes, that is subgroups of ${\mathbb Z_{2}^{\alpha}\mathbb Z_{4}^{\beta}}$ . Two kinds of maximum distance separable codes are studied. We determine all possible parameters of these codes and characterize the codes in certain cases. The main results are also valid when ?? = 0, namely for quaternary linear codes.     

Navigating in the Cayley Graphs of {\rm SL}_{N}(\mathbb{Z}) and {\rm SL}_{N}(\mathbb{F}_{p})

We give a nondeterministic algorithm that expresses elements of , for N ≥ 3, as words in a finite set of generators, with the length of these words at most a constant times the word metric. We show that the nondeterministic time-complexity of the subtractive version of Euclid’s algorithm for finding the greatest common divisor of N ≥ 3 integers a₁, ..., a_N is at most a constant times . This leads to an elementary proof that for N ≥ 3 the word metric in is biLipschitz equivalent to the logarithm of the matrix norm – an instance of a theorem of Mozes, Lubotzky and Raghunathan. And we show constructively that there exists K>0 such that for all N ≥ 3 and primes p, the diameter of the Cayley graph of with respect to the generating set is at most .Mathematics Subject Classification: 20F05     

A Construction of Partial Difference Sets in {\mathbb{Z}}_{p^{2 \times } } {\mathbb{Z}}_{p^{2 \times \cdot \cdot \cdot \times } } {\mathbb{Z}}_{p^2 }

In this paper, we give a construction of partial difference sets in _p ² x _p ² x ... x _p ²using some finite local rings.Dedicated to Hanfried Lenz on the occasion of his 80th birthdayThe work of this paper was done when the authors visited the University of Hong Kong.     

Local solvability on {\mathbb{H}_1}: non-homogeneous operators

Local solvability and non-solvability are classified for left-invariant differential operators on the Heisenberg group ${\mathbb{H}_1}$ of the form L?=?P _n (X, Y)?+?Q(X, Y) where the P _n are certain homogeneous polynomials of order n?≥ 2 and Q is of lower order with ${X=\partial_x,\,Y=\partial_y+x\partial_w}$ on ${\mathbb{R}^3}$ . We extend previous studies of operators of the form P _n (X, Y) via representations involving ordinary differential operators with a parameter.     

$${\mathbb{Z}_2\mathbb{Z}_4}$$-linear codes: rank and kernel

A code C{{\mathcal C}} is \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C{{\mathcal C}} by deleting the coordinates outside X (respectively, Y) is a binary linear code (respectively, a quaternary linear code). The corresponding binary codes of \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-additive codes under an extended Gray map are called \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes. In this paper, the invariants for \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the rank and dimension of the kernel, are studied. Specifically, given the algebraic parameters of \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the possible values of these two invariants, giving lower and upper bounds, are established. For each possible rank r between these bounds, the construction of a \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with rank r is given. Equivalently, for each possible dimension of the kernel k, the construction of a \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with dimension of the kernel k is given. Finally, the bounds on the rank, once the kernel dimension is fixed, are established and the construction of a \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code for each possible pair (r, k) is given.     

A variant of Mathias forcing that preserves {\mathsf{ACA}_0}

We present and analyze ${F_\sigma}$ -Mathias forcing, which is similar but tamer than Mathias forcing. In particular, we show that this forcing preserves certain weak subsystems of second-order arithmetic such as ${\mathsf{ACA}_0}$ and ${\mathsf{WKL}_0 + \mathsf{I}\Sigma^0_2}$ , whereas Mathias forcing does not. We also show that the needed reals for ${F_\sigma}$ -Mathias forcing (in the sense of Blass in Ann Pure Appl Logic 109(1–2):77–88, 2001) are just the computable reals, as opposed to the hyperarithmetic reals for Mathias forcing.     

{\mathbb{G}_a^ M} degeneration of flag varieties

Let ${\mathcal{F}_\lambda}$ be a generalized flag variety of a simple Lie group G embedded into the projectivization of an irreducible G-module V _λ . We define a flat degeneration ${\mathcal{F}_\lambda^a}$ , which is a ${\mathbb{G}^M_a}$ variety. Moreover, there exists a larger group G ^a acting on ${\mathcal{F}_\lambda^a}$ , which is a degeneration of the group G. The group G ^a contains ${\mathbb{G}^M_a}$ as a normal subgroup. If G is of type A, then the degenerate flag varieties can be embedde‘d into the product of Grassmannians and thus to the product of projective spaces. The defining ideal of ${\mathcal{F}_\lambda}$ is generated by the set of degenerate Plücker relations. We prove that the coordinate ring of ${\mathcal{F}_\lambda^a}$ is isomorphic to a direct sum of dual PBW-graded ${\mathfrak{g}}$ -modules. We also prove that there exists bases in multi-homogeneous components of the coordinate rings, parametrized by the semistandard PBW-tableux, which are analogs of semistandard tableaux.     

Linear codes over {\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}

In this work, we investigate linear codes over the ring ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ . We first analyze the structure of the ring and then define linear codes over this ring which turns out to be a ring that is not finite chain or principal ideal contrary to the rings that have hitherto been studied in coding theory. Lee weights and Gray maps for these codes are defined by extending on those introduced in works such as Betsumiya et al. (Discret Math 275:43–65, 2004) and Dougherty et al. (IEEE Trans Inf 45:32–45, 1999). We then characterize the ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linearity of binary codes under the Gray map and give a main class of binary codes as an example of ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linear codes. The duals and the complete weight enumerators for ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linear codes are also defined after which MacWilliams-like identities for complete and Lee weight enumerators as well as for the ideal decompositions of linear codes over ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ are obtained.     

Difference Sets in {\mathbb{Z}}_4^m and {\mathbb{F}}_2^{2m}

Let R=GR(4,m) be the Galois ring of cardinality 4^m and let T be the Teichmüller system of R. For every map λ of T into { -1,+1} and for every permutation Π of T, we define a map φ _λ ^Π of Rinto { -1,+1} as follows: if x∈R and if x=a+2b is the 2-adic representation of x with x∈T and b∈T, then φ _λ ^Π (x)=λ(a)+2Tr(Π(a)b), where Tr is the trace function of R . For i=1 or i=-1, define D _i as the set of x in R such thatφ _λ ^Π =i. We prove the following results: 1) D _i is a Hadamard difference set of (R,+). 2) If φ is the Gray map of R into ${\mathbb{F}}_2^{2m}$ , then (D _i) is a difference set of ${\mathbb{F}}_2^{2m}$ . 3) The set of D _i and the set of φ(D _i) obtained for all maps λ and Π, both are one-to-one image of the set of binary Maiorana-McFarland difference sets in a simple way. We also prove that special multiplicative subgroups of R are difference sets of kind D _i in the additive group of R. Examples are given by means of morphisms and norm in R.     

Extremal effective divisors on \overline{\mathcal M}_{1,n}

For every \(n\ge 3\) , we exhibit infinitely many extremal effective divisors on \(\overline{\mathcal M}_{1,n}\) , the Deligne-Mumford moduli space parameterizing stable genus one curves with \(n\) ordered marked points.     

Additive semisimple multivariable codes over {\mathbb{F}_4}

The structure of additive multivariable codes over ${\mathbb{F}_4}$ (the Galois field with 4 elements) is presented. The semisimple case (i.e., when the defining polynomials of the code have no repeated roots) is specifically addressed. These codes extend in a natural way the abelian codes, of which additive cyclic codes of odd length are a particular case. Duality of these codes is also studied.     

The reducible Specht modules for the Hecke algebra \mathcal{H}_{\mathbb{C},{-}1}(\mathfrak{S}_{n})

The reducible Specht modules for the Hecke algebra $\mathcal {H}_{\mathbb{F},q}(\mathfrak{S}_{n})$ have been classified except when q=?1. We prove one half of a conjecture which we believe classifies the reducible Specht modules when q=?1.     

Burgess Inequality In {\mathbb {F}_{p^2}}

The purpose of the paper is to present new estimates on incomplete character sums in finite fields that are of the strength of Burgess’ celebrated theorem for prime fields. More precisely, an inequality of this type is obtained in F_p²{F_{p^2}} and also for binary quadratic forms, improving on the work of Davenport–Lewis and on several results due to Burgess. The arguments are based on new estimates for the multiplicative energy of certain sets that allow us to improve the amplification step in Burgess’ method.     

Conservative fragments of {{S}^{1}_{2}} and {{R}^{1}_{2}}

Conservative subtheories of ${{R}^{1}_{2}}$ and ${{S}^{1}_{2}}$ are presented. For ${{S}^{1}_{2}}$ , a slight tightening of Je?ábek??s result (Math Logic Q 52(6):613?C624, 2006) that ${T^{0}_{2} \preceq_{\forall \Sigma^{b}_{1}}S^{1}_{2}}$ is presented: It is shown that ${T^{0}_{2}}$ can be axiomatised as BASIC together with induction on sharply bounded formulas of one alternation. Within this ${\forall\Sigma^{b}_{1}}$ -theory, we define a ${\forall\Sigma^{b}_{0}}$ -theory, ${T^{-1}_{2}}$ , for the ${\forall\Sigma^{b}_{0}}$ -consequences of ${S^{1}_{2}}$ . We show ${T^{-1}_{2}}$ is weak by showing it cannot ${\Sigma^{b}_{0}}$ -define division by 3. We then consider what would be the analogous ${\forall\hat\Sigma^{b}_{1}}$ -conservative subtheory of ${R^{1}_{2}}$ based on Pollett (Ann Pure Appl Logic 100:189?C245, 1999. It is shown that this theory, ${{T}^{0,\left\{2^{(||\dot{id}||)}\right\}}_{2}}$ , also cannot ${\Sigma^{b}_{0}}$ -define division by 3. On the other hand, we show that ${{S}^{0}_{2}+open_{\{||id||\}}}$ -COMP is a ${\forall\hat\Sigma^{b}_{1}}$ -conservative subtheory of ${R^{1}_{2}}$ . Finally, we give a refinement of Johannsen and Pollett (Logic Colloquium?? 98, 262?C279, 2000) and show that ${\hat{C}^{0}_{2}}$ is ${\forall\hat\Sigma^{b}_{1}}$ -conservative over a theory based on open _cl-comprehension.     

A class of {\Sigma _{3}^{0}} modular lattices embeddable as principal filters in {\mathcal{L}^{\ast }(V_{\infty })}

Let I ₀ be a a computable basis of the fully effective vector space V _∞ over the computable field F. Let I be a quasimaximal subset of I ₀ that is the intersection of n maximal subsets of the same 1-degree up to *. We prove that the principal filter ${\mathcal{L}^{\ast}(V,\uparrow )}$ of V = cl(I) is isomorphic to the lattice ${\mathcal{L}(n, \overline{F})}$ of subspaces of an n-dimensional space over ${\overline{F}}$ , a ${\Sigma _{3}^{0}}$ extension of F. As a corollary of this and the main result of Dimitrov (Math Log 43:415–424, 2004) we prove that any finite product of the lattices ${(\mathcal{L}(n_{i}, \overline{F }_{i}))_{i=1}^{k}}$ is isomorphic to a principal filter of ${\mathcal{ L}^{\ast}(V_{\infty})}$ . We thus answer Question 5.3 “What are the principal filters of ${\mathcal{L}^{\ast}(V_{\infty}) ?}$ ” posed by Downey and Remmel (Computable algebras and closure systems: coding properties, handbook of recursive mathematics, vol 2, pp 977–1039, Stud Log Found Math, vol 139, North-Holland, Amsterdam, 1998) for spaces that are closures of quasimaximal sets.