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.     

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.     

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.     

Schatten class Hankel and $$\overline{\partial }$$ ∂ ¯ -Neumann operators on pseudoconvex domains in $$\mathbb {C}^{n}$$ C n

Monatshefte für Mathematik - Let $$\Omega $$ be a $$C^2$$ -smooth bounded pseudoconvex domain in $$\mathbb {C}^n$$ for $$n\ge 2$$ and let $$\varphi $$ be a holomorphic function on $$\Omega $$...     

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...     

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.     

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.     

On $$\mathbb {R}$$-Linear Problem and Truncated Wiener–Hopf Equation

Siberian Advances in Mathematics - We consider the $$\mathbb {R}$$-linear problem (also known as the Markushevich problem and the generalized Riemann boundary value problem) and the convolution...     

Modified Alternating $$\vec{k}$$–generators

This paper deals with a class of pseudorandom bit generators – modified alternating –generators. This class is constructed similarly to the class of alternating step generators. Three subclasses of are distinguished, namely linear, mixed and nonlinear generators. The main attention is devoted to the subclass of linear and mixed generators generating periodic sequences with maximal period lengths. A necessary and sufficient condition for all sequences generated by the linear generators of to be with maximal period lengths is formulated. Such sequences have good statistical properties, such as distribution of zeroes and ones, and large linear complexity. Two methods of cryptanalysis of the proposed generators are given. Finally, three new classes of modified alternating –generators, designed especially to be more secure, are presented.     

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.      

Pencils of quadrics and Gromov–Witten–Welschinger invariants of $$\mathbb {C}P^3$$

We establish a formula for the Gromov–Witten–Welschinger invariants of \(\mathbb {C}P^3\) with mixed real and conjugate point constraints. The method is based on a suggestion by J. Kollár that, considering pencils of quadrics, some real and complex enumerative invariants of \(\mathbb {C}P^3\) could be computed in terms of enumerative invariants of \(\mathbb {C}P^1\times \mathbb {C}P^1\) and of elliptic curves.     

Schiffer’s Problem and an Isoperimetric Inequality for the First Buckling Eigenvalue of Domains on $$\mathbb{S}^{2}$$

We consider the overdetermined eigenvalue problem on a sufficiently regular connected open domain Ω on the 2-sphere :

Bavrin’s Type Factorization of the Temljakov Operator for Holomorphic Functions in Circular Domains of $$\mathbb {C}^{n}$$

The paper concerns investigations of holomorphic functions of several complex variables with a factorization of their Temljakov transform. Firstly, there were considered some inclusions between the families \(\mathcal {C}_{\mathcal {G}},\mathcal {M}_{\mathcal {G}},\mathcal {N}_{\mathcal {G}},\mathcal {R}_{\mathcal {G}},\mathcal {V}_{\mathcal {G}}\) of such holomorphic functions on complete n-circular domain \(\mathcal {G}\) of \(\mathbb {C}^{n}\) in some papers of Bavrin, Fukui, Higuchi, Michiwaki. A motivation of our investigations is a condensation of the mentioned inclusions by some new families of Bavrin’s type. Hence we consider some families \(\mathcal {K}_{ \mathcal {G}}^{k},k\ge 2,\) of holomorphic functions f :  \(\mathcal {G}\rightarrow \mathbb {C},f(0)=1,\) defined also by a factorization of \( \mathcal {L}f\) onto factors from \(\mathcal {C}_{\mathcal {G}}\) and \(\mathcal {M} _{\mathcal {G}}.\) We present some interesting properties and extremal problems on \(\mathcal {K}_{\mathcal {G}}^{k}\).     

Stable spike clusters for the precursor Gierer–Meinhardt system in $$\mathbb {R}^2$$

We consider the Gierer–Meinhardt system with small inhibitor diffusivity, very small activator diffusivity and a precursor inhomogeneity. For any given positive integer k we construct a spike cluster consisting of k spikes which all approach the same nondegenerate local minimum point of the precursor inhomogeneity. We show that this spike cluster can be linearly stable. In particular, we show the existence of spike clusters for spikes located at the vertices of a polygon with or without centre. Further, the cluster without centre is stable for up to three spikes, whereas the cluster with centre is stable for up to six spikes. The main idea underpinning these stable spike clusters is the following: due to the small inhibitor diffusivity the interaction between spikes is repulsive, and the spikes are attracted towards the local minimum point of the precursor inhomogeneity. Combining these two effects can lead to an equilibrium of spike positions within the cluster such that the cluster is linearly stable.     

Certain Somos’s $$\varvec{}$$–$$\varvec{Q}$$Q type Dedekind $$\varvec{\eta }$$η-function identities

In this paper, we provide a new proof for the Dedekind \(\eta \)-function identities discovered by Somos. During this process, we found two new Dedekind \(\eta \)-function identities. Furthermore, we extract interesting partition identities from some of the \(\eta \)-function identities.     

A $\mathbb{P}_N × \mathbb{P}_N$ Spectral Element Projection Method for the Unsteady Incompressible Navier-Stokes Equations

In this paper, we present a $\mathbb{P}_N × \mathbb{P}_N$ spectral element method and a detailed comparison with existing methods for the unsteady incompressible Navier-Stokes equations. The main purpose of this work consists of: (i) detailed comparison and discussion of some recent developments of the temporal discretizations in the frame of spectral element approaches in space; (ii) construction of a stable $\mathbb{P}_N × \mathbb{P}_N$ method together with a $\mathbb{P}_N → \mathbb{P}_{N-2}$post-filtering. The link of different methods will be clarified. The key feature of our method lies in that only one grid is needed for both velocity and pressure variables, which differs from most well-known solvers for the Navier-Stokes equations. Although not yet proven by rigorous theoretical analysis, the stability and accuracy of this one-grid spectral method are demonstrated by a series of numerical experiments.     

ANNIHILATORS OF HIGHEST WEIGHT $$ \mathfrak{s}\mathfrak{l} $$(∞)-MODULES

We give a criterion for the annihilator in U(\( \mathfrak{s}\mathfrak{l} \)(∞)) of a simple highest weight \( \mathfrak{s}\mathfrak{l} \)(∞)-module to be nonzero. As a consequence we show that, in contrast with the case of \( \mathfrak{s}\mathfrak{l} \)(n), the annihilator in U(\( \mathfrak{s}\mathfrak{l} \)(∞)) of any simple highest weight \( \mathfrak{s}\mathfrak{l} \)(∞)-module is integrable, i.e., coincides with the annihilator of an integrable \( \mathfrak{s}\mathfrak{l} \)(∞)-module. Furthermore, we define the class of ideal Borel subalgebras of \( \mathfrak{s}\mathfrak{l} \)(∞), and prove that any prime integrable ideal in U(\( \mathfrak{s}\mathfrak{l} \)(∞)) is the annihilator of a simple \( \mathfrak{b} \) ⁰-highest weight module, where \( \mathfrak{b} \) ⁰ is any fixed ideal Borel subalgebra of \( \mathfrak{s}\mathfrak{l} \)(∞). This latter result is an analogue of the celebrated Duoflo Theorem for primitive ideals.