Self-dual normal integral bases for infinite unramified extensions

We prove a generalization to infinite Galois extensions of local fields, of a classical result by Noether on the existence of normal integral bases for finite tamely ramified Galois extensions. We also prove a self-dual normal integral basis theorem for infinite unramified Galois field extensions of local fields with finite residue fields of characteristic different from 2. This generalizes a result by Fainsilber for the finite case. To do this, we obtain an injectivity result concerning pointed cohomology sets, defined by inverse limits of norm-one groups of free finite-dimensional algebras with involution over complete discrete valuation rings.     

On self-dual normal bases

We deal with the existence of self-dual normal basis for Galois extensions of a commutative ring. We consider commutative rings which are local, connected semi-local (under some suitable restrictions) or zero-dimensional. We show that for such kind of rings every Galois extension of odd degree has a self-dual normal basis.     

Explicit construction of self-dual integral normal bases for the square-root of the inverse different

Let K be a finite extension of Qp, let L/K be a finite abelian Galois extension of odd degree and let OL be the valuation ring of L. We define AL/K to be the unique fractional OL-ideal with square equal to the inverse different of L/K. For p an odd prime and L/Qp contained in certain cyclotomic extensions, Erez has described integral normal bases for AL/Qp that are self-dual with respect to the trace form. Assuming K/Qp to be unramified we generate odd abelian weakly ramified extensions of K using Lubin-Tate formal groups. We then use Dwork's exponential power series to explicitly construct self-dual integral normal bases for the square-root of the inverse different in these extensions.     

Galois self-dual extended duadic constacyclic codes

Galois inner product is a generalization of the Euclidean inner product and Hermitian inner product. The theory on linear codes under Galois inner product can be applied in the constructions of MDS codes and quantum error-correcting codes. In this paper, we construct Galois self-dual codes and MDS Galois self-dual codes from extensions of constacyclic codes. First, we explicitly determine all the Type II splittings leading to all the Type II duadic constacyclic codes in two cases. Second, we propose methods to extend two classes of constacyclic codes to obtain Galois self-dual codes, and we also provide existence conditions of Galois self-dual codes which are extensions of constacyclic codes. Finally, we construct some (almost) MDS Galois self-dual codes using the above results. Some Galois self-dual codes and (almost) MDS Galois self-dual codes obtained in this paper turn out to be new.     

Isospectral deformation of the reduced quasi-classical self-dual Yang–Mills equation

We derive a new four-dimensional partial differential equation with the isospectral Lax representation by shrinking the symmetry algebra of the reduced quasi-classical self-dual Yang–Mills equation and applying the technique of twisted extensions to the obtained Lie algebra. Then we find a recursion operator for symmetries of the new equation and construct a Bäcklund transformation between this equation and the four-dimensional Martínez Alonso–Shabat equation. Finally, we construct extensions of the integrable hierarchies associated to the hyper-CR equation for Einstein–Weyl structures, the reduced quasi-classical self-dual Yang–Mills equation, the four-dimensional universal hierarchy equation, and the four-dimensional Martínez Alonso–Shabat equation.     

Self-dual bases in\mathbb{F}_{q^n }

We characterize weakly self-dual bases of the field extension over , examine the existence of weakly self-dual polynomial bases, and use duality to analyze normal basis multiplication.     

Elliptic periods for finite fields

We construct two new families of basis for finite field extensions. Bases in the first family, the so-called elliptic bases, are not quite normal bases, but they allow very fast Frobenius exponentiation while preserving sparse multiplication formulas. Bases in the second family, the so-called normal elliptic bases are normal bases and allow fast (quasi-linear) arithmetic. We prove that all extensions admit models of this kind.     

Irredundant self-dual bases for self-dual lattice varieties

For any finitely based self-dual variety of lattices, we determine the sizes of all equational bases that are both irredundant and self-dual. We make the same determination for {0, 1}-lattice varieties.Received July 11, 2002; accepted in final form August 27, 2004.     

Enumerating bases of self-dual matroids

We define involutively self-dual matroids and prove that an enumerator for their bases is the square of a related enumerator for their self-dual bases. This leads to a new proof of Tutte's theorem that the number of spanning trees of a central reflex is a perfect square, and it solves a problem posed by Kalai about higher dimensional spanning trees in simplicial complexes. We also give a weighted version of the latter result.We give an algebraic analogue relating to the critical group of a graph, a finite abelian group whose order is the number of spanning trees of the graph. We prove that the critical group of a central reflex is a direct sum of two copies of an abelian group, and conclude with an analogous result in Kalai's setting.     

Trellis Structure and Higher Weights of Extremal Self-Dual Codes

A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and corresponding permutations are known for relatively few codes.The task of finding such permutations is shown to be substantially simplifiable in the case of self-dual codes in general, and for self-dual codes of sufficiently high minimum distance it is shown that it is frequently possible to deduce the existence of these permutations directly from the parameters of the code.A new and tighter link between generalized Hamming weights and trellis representations is demonstrated: for some self-dual codes, knowledge of one of the generalized Hamming weights is sufficient to determine the entire optimal state complexity profile.These results are used to characterize the permutation-optimal trellises and generalized Hamming weights for all [32,16,8] binary self-dual codes and for several other codes. The numbers of uniformly efficient permutations for several codes, including the [24,12,8] Golay code and both [24,12,9] ternary self-dual codes, are found.     

Cyclic extensions of odometer transformations and spectral disjointness

We discuss spectral properties of cyclic extensions of the odometer transformations. We prove that continuous power spectral measures corresponding to two of them with multiplicatively independent bases are mutually singular. These measures can be used to distinguish sets of normal numbers to multiplicatively independent bases.     

Self-dual bases for varieties of orthomodular lattices

For any finitely based variety of orthomodular lattices, we determine the sizes of all equational bases that are both irredundant and self-dual.     

Lattice-like operations and isotone projection sets

By using some lattice-like operations which constitute extensions of ones introduced by M.S. Gowda, R. Sznajder and J. Tao for self-dual cones, a new perspective is gained on the subject of isotonicity of the metric projection onto the closed convex sets. The results of this paper are wide range generalizations of some results of the authors obtained for self-dual cones. The aim of the subsequent investigations is to put into evidence some closed convex sets for which the metric projection is isotonic with respect to the order relation which give rise to the above mentioned lattice-like operations. The topic is related to variational inequalities where the isotonicity of the metric projection is an important technical tool. For Euclidean sublattices this approach was considered by G. Isac and respectively by H. Nishimura and E.A. Ok.     

Construction of normal bases of rings of integral elements of certain fields of algebraic functions

This article is devoted to the construction of normal bases of rings of integral elements of certain fields of algebraic functions. These fields are algebraic extensions of the initial fields, given by appropriate algebraic equations. The extensions are given only by the monodromy group. The device of the matrix Riemann boundary-value problem on a Riemann surface is used.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 7, pp. 1004–1007, July, 1990.     

Gröbner Bases for Ideals of σ-PBW Extensions

In this article, we introduce the σ-PWB extensions and construct the theory of Gröbner bases for the left ideals of them. We prove the Hilbert's basis theorem and the division algorithm for this more general class of Poincaré–Birkhoff–Witt extensions. For the particular case of bijective and quasi-commutative σ-PWB extensions, we implement the Buchberger's algorithm for computing Gröbner bases of left ideals.     

Hopf algebra deformations of binary polyhedral groups

We show that semisimple Hopf algebras having a self-dual faithful irreducible comodule of dimension 2 are always obtained as abelian extensions with quotient Z2. We prove that nontrivial Hopf algebras arising in this way can be regarded as deformations of binary polyhedral groups and describe its category of representations. We also prove a strengthening of a result of Nichols and Richmond on cosemisimple Hopf algebras with a two-dimensional irreducible comodule in the finite-dimensional context. Finally, we give some applications to the classification of certain classes of semisimple Hopf algebras.     

Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism

We study the complexity of determining whether a polytope given by its vertices or facets is combinatorially isomorphic to its polar dual. We prove that this problem is Graph Isomorphism hard, and that it is Graph Isomorphism complete if and only if Vertex Enumeration is Graph Isomorphism easy. To the best of our knowledge, this is the first problem that is not equivalent to Vertex Enumeration and whose complexity status has a non-trivial impact on the complexity of Vertex Enumeration irrespective of whether checking Self-duality turns out to be strictly harder than Graph Isomorphism or equivalent to Graph Isomorphism. The constructions employed in the proof yield a class of self-dual polytopes that are interesting on their own. In particular, this class of self-dual polytopes has the property that the facet-vertex incident matrix of the polytope is transposable if and only if the matrix is symmetrizable as well. As a consequence of this construction, we also prove that checking self-duality of a polytope, given by its facet-vertex incidence matrix, is Graph Isomorphism complete, thereby answering a question of Kaibel and Schwartz.     

Abelian Groups,Gauss Periods,and Normal Bases

A result on finite abelian groups is first proved and then used to solve problems in finite fields. Particularly, all finite fields that have normal bases generated by general Gauss periods are characterized and it is shown how to find normal bases of low complexity.     

Homogeneous Self-dual Algorithms for Stochastic Second-Order Cone Programming

Jin et al. (in J. Optim. Theory Appl. 155:1073–1083, 2012) proposed homogeneous self-dual algorithms for stochastic semidefinite programs with finite event space. In this paper, we utilize their work to derive homogeneous self-dual algorithms for stochastic second-order cone programs with finite event space. We also show how the structure in the stochastic second-order cone programming problems may be exploited so that the algorithms developed for these problems have less complexity than the algorithms developed for stochastic semidefinite programs mentioned above.     

Completely normal elements in some finite abelian extensions

We present some completely normal elements in the maximal real subfields of cyclotomic fields over the field of rational numbers, relying on the criterion for normal element developed in [Jung H.Y., Koo J.K., Shin D.H., Normal bases of ray class fields over imaginary quadratic fields, Math. Z., 2012, 271(1–2), 109–116]. And, we further find completely normal elements in certain abelian extensions of modular function fields in terms of Siegel functions.