Epsilon–delta surgery over $${mathbb{Z}}$$

The purpose of this paper is to prove a controlled surgery exact sequence, including a stability theorem, as used in the construction of exotic homology manifolds. The approach is to show that this result is a formal consequence of the Chapman–Ferry Alpha-approximation theorem.     

Bauer–Furuta invariants under $${\mathbb{Z}_2}$$ -actions

S. Bauer and M. Furuta defined a stable cohomotopy refinement of the Seiberg–Witten invariants. In this paper, we prove a vanishing theorem of Bauer–Furuta invariants for 4-manifolds with smooth -actions. As an application, we give a constraint on smooth -actions on homotopy K3#K3, and construct a nonsmoothable locally linear -action on K3#K3. We also construct a nonsmoothable locally linear -action on K3.      

Lattices from codes over $$\mathbb {Z}_q$$: generalization of constructions D, $$ D'$$ D′ and $$\overline{ D}$$ D¯

In this paper, we extend the lattice Constructions D, \(D'\) and \(\overline{D}\) (this latter is also known as Forney’s code formula) from codes over \(\mathbb {F}_p\) to linear codes over \(\mathbb {Z}_q\), where \(q \in \mathbb {N}\). We define an operation in \(\mathbb {Z}_q^n\) called zero-one addition, which coincides with the Schur product when restricted to \(\mathbb {Z}_2^n\) and show that the extended Construction \(\overline{D}\) produces a lattice if and only if the nested codes are closed under this addition. A generalization to the real case of the recently developed Construction \(A'\) is also derived and we show that this construction produces a lattice if and only if the corresponding code over \(\mathbb {Z}_q[X]/X^a\) is closed under a shifted zero-one addition. One of the motivations for this work is the recent use of q-ary lattices in cryptography.     

Weighted Reed–Muller codes revisited

We consider weighted Reed–Muller codes over point ensemble S ₁ × · · · × S _m where S _i needs not be of the same size as S _j . For m = 2 we determine optimal weights and analyze in detail what is the impact of the ratio |S ₁|/|S ₂| on the minimum distance. In conclusion the weighted Reed–Muller code construction is much better than its reputation. For a class of affine variety codes that contains the weighted Reed–Muller codes we then present two list decoding algorithms. With a small modification one of these algorithms is able to correct up to 31 errors of the [49,11,28] Joyner code.     

Minimal codewords in Reed–Muller codes

Minimal codewords were introduced by Massey (Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp 276–279, 1993) for cryptographical purposes. They are used in particular secret sharing schemes, to model the access structures. We study minimal codewords of weight smaller than 3 · 2 ^m−r in binary Reed–Muller codes RM(r, m) and translate our problem into a geometrical one, using a classification result of Kasami and Tokura (IEEE Trans Inf Theory 16:752–759, 1970) and Kasami et al. (Inf Control 30(4):380–395, 1976) on Boolean functions. In this geometrical setting, we calculate numbers of non-minimal codewords. So we obtain the number of minimal codewords in the cases where we have information about the weight distribution of the code RM(r, m). The presented results improve previous results obtained theoretically by Borissov et al. (Discrete Appl Math 128(1), 65–74, 2003), and computer aided results of Borissov and Manev (Serdica Math J 30(2-3), 303–324, 2004). This paper is in fact an extended abstract. Full proofs can be found on the arXiv.     

ON HEYDE’S THEOREM ON THE GROUP $$\mathbb{R}$$ × $$\mathbb{T}$$

Doklady Mathematics - According to the well-knows Heyde theorem the Gaussian distribution on the real line is characterized by the symmetry of the conditional distribution of one linear form of...     

Poletsky–Stessin Hardy Spaces on Complex Ellipsoids in $$\mathbb {C}^{n}$$

We study Poletsky–Stessin Hardy spaces on complex ellipsoids in \(\mathbb {C}^{n}\). Different from one variable case, classical Hardy spaces are strictly contained in Poletsky–Stessin Hardy spaces on complex ellipsoids so boundary values are not automatically obtained in this case. We have showed that functions belonging to Poletsky–Stessin Hardy spaces have boundary values and they can be approached through admissible approach regions in the complex ellipsoid case. Moreover, we have obtained that polynomials are dense in these spaces. We also considered the composition operators acting on Poletsky–Stessin Hardy spaces on complex ellipsoids and gave conditions for their boundedness and compactness.     

The Iwasawa invariant $$\mu$$ μ vanishes for $$\mathbb{Z}_{2}$$ Z 2 -extensions of certain real biquadratic fields

Acta Mathematica Hungarica - For a real biquadratic field, we denote by $$\lambda$$ , $$\mu$$ and $$\nu$$ the Iwasawa invariants of cyclotomic $$\mathbb{Z}_{2}$$ -extension of $$k$$ . We give...     

Extremal Self-Dual Codes over \mathbb{F} 2 × \mathbb{F} 2

In this paper, it is shown that extremal (Hermitian) self-dual codes over ₂ × ₂ exist only for lengths 1, 2, 3, 4, 5, 8 and 10. All extremal self-dual codes over ₂ × ₂ are found. In particular, it is shown that there is a unique extremal self-dual code up to equivalence for lengths 8 and 10. Optimal self-dual codes are also investigated. A classification is given for binary [12, 7, 4] codes with dual distance 4, binary [13, 7, 4] codes with dual distance 4 and binary [13, 8, 4] codes with dual distance 4.     

Blowup relations on $$mathbb{C}^2/mathbb{Z}_2$$ from Nakajima–Yoshioka blowup relations

Theoretical and Mathematical Physics - Using an elementary algebraic approach, from the Nakajima–Yoshioka blowup relations, we obtain bilinear relations for the Nekrasov partition functions...     

Optimal software-implemented Itoh–Tsujii inversion for $$\mathbb {F}_{2^{m}}$$

Field inversion in \(\mathbb {F}_{2^{m}}\) dominates the cost of modern software implementations of certain elliptic curve cryptographic operations, such as point encoding/hashing into elliptic curves (Brown et al. in: Submission to NIST, 2008; Brown in: IACR Cryptology ePrint Archive 2008:12, 2008; Aranha et al. in: Cryptology ePrint Archive, Report 2014/486, 2014) Itoh–Tsujii inversion using a polynomial basis and precomputed table-based multi-squaring has been demonstrated to be highly effective for software implementations (Taverne et al. in: CHES 2011, 2011; Oliveira et al. in: J Cryptogr Eng 4(1):3–17, 2014; Aranha et al. in: Cryptology ePrint Archive, Report 2014/486, 2014), but the performance and memory use depend critically on the choice of addition chain and multi-squaring tables, which in prior work have been determined only by suboptimal ad-hoc methods and manual selection. We thoroughly investigated the performance/memory tradeoff for table-based linear transforms used for efficient multi-squaring. Based upon the results of that investigation, we devised a comprehensive cost model for Itoh–Tsujii inversion and a corresponding optimization procedure that is empirically fast and provably finds globally-optimal solutions. We tested this method on eight binary fields commonly used for elliptic curve cryptography; our method found lower-cost solutions than the ad-hoc methods used previously, and for the first time enables a principled exploration of the time/memory tradeoff of inversion implementations.     

Periodic maximal surfaces in the Lorentz–Minkowski space $${\mathbb{L}^3}$$

A maximal surface with isolated singularities in a complete flat Lorentzian 3-manifold

Projective Reed–Muller type codes on rational normal scrolls

In this paper we study an instance of projective Reed–Muller type codes, i.e., codes obtained by the evaluation of homogeneous polynomials of a fixed degree in the points of a projective variety. In our case the variety is an important example of a determinantal variety, namely the projective surface known as rational normal scroll, defined over a finite field, which is the basic underlining algebraic structure of this work. We determine the dimension and a lower bound for the minimum distance of the codes, and in many cases we also find the exact value of the minimum distance. To obtain the results we use some methods from Gröbner bases theory.     

${mathbb{Z}}/3{mathbb{Z}}$-量子群的Gr\"{o}bner-Shirshov 基

通过计算合成, 我们证明了Yamane 给出的关系是 ${mathbb{Z}}/3{mathbb{Z}}$-量子群的一个Gr\"{o}bner-Shirshov 基.     

Projective Compactification of $$\mathbb {R}^{1,1}$$ and Its Möbius Geometry

We examine the semi-Riemannian manifold \(\mathbb {R}^{1,1}\), which is realized as the split complex plane, and its conformal compactification as an analogue of the complex plane and the Riemann sphere. We also consider conformal maps on the compactification and study some of their basic properties.     

{\mathbb{Z}_2}-bordism and the Borsuk–Ulam Theorem

The purpose of this work is to classify, for given integers \({m,\, n\geq 1}\), the bordism class of a closed smooth \({m}\)-manifold \({X^m}\) with a free smooth involution \({\tau}\) with respect to the validity of the Borsuk–Ulam property that for every continuous map \({\phi : X^m \to \mathbb{R}^n}\) there exists a point \({x\in X^m}\) such that \({\phi (x)=\phi (\tau (x))}\). We will classify a given free \({\mathbb{Z}_2}\)-bordism class \({\alpha}\) according to the three possible cases that (a) all representatives \({(X^m, \tau)}\) of \({\alpha}\) satisfy the Borsuk–Ulam property; (b) there are representatives \({({X_{1}^{m}}, \tau_1)}\) and \({({X_{2}^{m}}, \tau_2)}\) of \({\alpha}\) such that \({({X_{1}^{m}}, \tau_1)}\) satisfies the Borsuk–Ulam property but \({({X_{2}^{m}}, \tau_2)}\) does not; (c) no representative \({(X^m, \tau)}\) of \({\alpha}\) satisfies the Borsuk–Ulam property.