Stefka Bouyuklieva, Nikolay Yankov, Radka Russeva
All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The purpose of this paper is to complete the classification of binary self-dual [48,24,10] codes with an automorphism of odd prime order. We prove that if there is a self-dual [48, 24, 10] code with an automorphism of type p-(c,f) with p being an odd prime, then p=3, c=16, f=0. By considering only an automorphism of type 3-(16,0), we prove that there are exactly 264 inequivalent self-dual [48, 24, 10] codes with an automorphism of odd prime order, equivalently, there are exactly 264 inequivalent cubic self-dual [48, 24, 10] codes.
Let C be a binary linear code and suppose that its automorphism group contains a non trivial subgroup G. What can we say about C knowing G? In this paper we collect some answers to this question in the cases G=C_p, G=C_2p and G=D_2p (p an odd prime), with a particular regard to the case in which C is self-dual. Furthermore we generalize some methods used in other papers on this subject. Finally we give a short survey on the problem of determining the automorphism group of a putative self-dual [72,36,16] code, in order to show where these methods can be applied.
A computer calculation with Magma shows that there is no extremal self-dual binary code C of length 72, whose automorphism group contains the symmetric group of degree 3, the alternating group of degree 4 or the dihedral group of order 8. Combining this with the known results in the literature one obtains that Aut(C) has order at most 5 or isomorphic to the elementary abelian group of order 8.
In this note, we complete the classification of extremal doubly even self-dual codes with 2-transitive automorphism groups.
The existence of an extremal self-dual binary linear code C of length 72 is a long-standing open problem. We continue the investigation of its automorphism group: looking at the combination of the subcodes fixed by different involutions and doing a computer calculation with Magma, we prove that Aut(C) is not isomorphic to the elementary abelian group of order 8. Combining this with the known results in the literature one obtains that Aut(C) has order at most 5.
It is shown that the automorphism group of a binary $q$-analog of the Fano plane is either trivial or of order $2$.
Hadamard matrices of orders 60 and 64 with automorphisms of orders 29 and 31
本文分类了 p=29、31 时具有 p 阶自同构的 2p+2 阶 Hadamard 矩阵，并据此构造计算，发现了若干新的三元及二元近极值自对偶码。
Using the method for constructing binary self-dual codes with an automorphism of order square of a prime number we have classified all binary self-dual codes with length 76 having minimum distance $d=14$ and automorphism of order 9. Up to equivalence, there are six self-dual $[76, 38, 14]$ codes with an automorphism of type $9$-$(8,0,4)$. All codes obtained have new values of the parameter in their weight enumerator thus more than doubling the number of known values.
It has been proven in a series of works that the order of the automorphism group of a binary [72,36,16] code does not exceed five. We obtain a parametrization of all self-dual binary codes of length 72 with automorphism of order 4 which can be extremal. We use extensive computations in MAGMA and on a supercomputer to show that an extremal binary code of length 72 does not have an element of order 4.
A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under some (quite strong) conditions on the codes. In order to prove it, we introduce a new family of binary codes: the semi self-dual codes. A binary self-orthogonal code is called semi self-dual if it contains the all-ones vector and is of codimension 2 in its dual code. We prove upper bounds on the dual distance of semi self-dual codes. As an application we get th…
We study some amalgamation classes introduced by Cherlin and prove the simplicity of the automorphism groups of the Fra{\"ı}ss{é} limits of these classes. We employ the machinery of stationary independence relations used by Tent and Ziegler.
The smallest set of admissible parameters of a $q$-analog of a Steiner system is $S_2[2,3,7]$. The existence of such a Steiner system -- known as a binary $q$-analog of the Fano plane -- is still open. In this article, the automorphism group of a putative binary $q$-analog of the Fano plane is investigated by a combination of theoretical and computational methods. As a conclusion, it is either rigid or its automorphism group is cyclic of order $2$, $3$ or $4$. Up to conjugacy in $\operatorname{GL}(7,2)$, there remains a single possible group of order $2$ and $4$, respectively, and two possible…
On automorphism groups of binary cyclic codes
本文研究了二元循环码的完整自同构群，提出了长长度二元循环码的构造方法，以促进完整自同构群的确定。
In this note we report the classification of all symmetric 2-(36,15,6) designs that admit an automorphism of order 2 and their incidence matrices generate an extremal ternary self-dual code. It is shown that up to isomorphism, there exists only one such design, having a full automorphism group of order 24, and the ternary code spanned by its incidence matrix is equivalent to the Pless symmetry code.
Point-line geometries related to binary equidistant codes
该研究探究对应二元等距码的奇异子空间的点线几何，刻画了这类几何的自同构，并发现在重要情形下存在由非单项式线性自同构诱导的自同构。
On the Structure of the Linear Codes with a Given Automorphism
本文研究有限域上具m阶置换自同构的线性码结构，将其归为广义准循环码，给出准循环码等为自正交、自对偶或线性互补对偶码的充要条件。
A $q$-analogue of a $t$-design is a set $S$ of subspaces (of dimension $k$) of a finite vector space $V$ over a field of order $q$ such that each $t$ subspace is contained in a constant $λ$ number of elements of $S$. The smallest nontrivial feasible parameters occur when $V$ has dimension $7$, $t=2$, $q=2$, and $k=3$; which is the $q$-analogue of a $2$-$(7,3,1)$ design, the Fano plane. The existence of the binary $q$-analogue of the Fano plane has yet to be resolved, and it was shown by Kiermaier et al. (2016) that such a configuration must have an automorphism group of order at most $2$. We s…
A $Z_2Z_4$-linear Hadamard code of length $α+2β=2^t$ is a binary Hadamard code which is the Gray map image of a $Z_2Z_4$-additive code with $α$ binary coordinates and $β$ quaternary coordinates. It is known that there are exactly $[(t-1)/2]$ and $[t/2]$ nonequivalent $Z_2Z_4$-linear Hadamard codes of length $2^t$, with $α=0$ and $α\not=0$, respectively, for all $t\geq 3$. In this paper, it is shown that each $Z_2Z_4$-linear Hadamard code with $α=0$ is equivalent to a $Z_2Z_4$-linear Hadamard code with $α\not=0$; so there are only $[t/2]$ nonequivalent $Z_2Z_4$-linear Hadamard codes of length $…
The dual stable Grothendieck polynomials $g_λ$ and their sums $\sum_{μ\subsetλ} g_μ$ (which represent $K$-homology classes of boundary ideal sheaves and structure sheaves of Schubert varieties in the Grassmannians) have the same product structure constants. In this paper we first explain that the ring automorphism $g_λ\mapsto\sum_{μ\subsetλ} g_μ$ on the ring of symmetric functions is described as the operator $F^\perp$, the adjoint of the multiplication $(F\cdot)$, by a "group-like" element $F=\sum_{i} h_i$ where $h_i$ is the complete symmetric function. Next we give a generalization: starting…
We prove that an automorphism of order 3 of a putative binary self-dual [120, 60, 24] code C has no fixed points. Moreover, the order of the automorphism group of C divides 2^a.3.5.7.19.23.29 where a is a nonegative integer. Automorphisms of odd composite order r may occur only for r=15, 57 or r=115 with corresponding cycle structures 15-(0,0,8;0), 57-(2,0,2;0) or 115-(1,0,1;0), respectively. In case that all involutions act fixed point freely we have |Aut(C)|<=920, and Aut(C) is solvable if it contains an element of prime order p>=7. Moreover, the alternating group A_5 is the only non-abelian…
Equality of Dual Immaculate Functions Under Automorphisms
该研究分类了拟对称函数代数中双无瑕函数在对合ρ、ψ、ω作用下的相等情况，确定了过渡矩阵首项与无瑕表格存在的充要条件，发现了与分划相关的新映射和典范表格。
It is shown that a necessary condition for an abstract group G to be the full automorphism group of a Hamiltonian cycle system is that G has odd order or it is either binary, or the affine linear group AGL(1; p) with p prime. We show that this condition is also sufficient except possibly for the class of non-solvable binary groups.
For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the convex polytope we build for the given finite group is binary, and even combinatorial in the sense of Naddef and Pulleyblank (1981); the diameter of its skeleton is at most 2; any combinatorial automorphism of the polytope is induced by some isometry of the space; any automorphism of the skeleton is a combinatorial automorphism.
We prove that a putative $[72,36,16]$ code is not the image of linear code over $\ZZ_4$, $\FF_2 + u \FF_2$ or $\FF_2+v\FF_2$, thus proving that the extremal doubly even $[72,36,16]$-binary code cannot have an automorphism group containing a fixed point-free involution. Combining this with the previously proved result by Bouyuklieva that such a code cannot have an automorphism group containing an involution with fixed points, we conclude that the automorphism group of the $[72,36,16]$-code cannot be of even order, leaving 3 and 5 as the only possibilities.
First Subconstituents of Orthogonal Graphs in Even Characteristic:Automorphisms, Cliques, Cores, and Binary Triple Transitivity
本文研究偶特征正交图第一子构成的结构，证明其为仿射极图补图，确定其自同构群、独立数、色数、最大团及核，并给出二元情形三重传递性的简短证明。
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary linear complementary dual $[n,k]$ codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete classification of binary linear complementary dual $[n,k]$ codes with the largest minimum weight is also given for $1 \le k \le n \le 16$.
The codewords of weight $10$ of the $[42,21,10]$ extended binary quadratic residue code are shown to hold a design of parameters $3-(42,10,18).$ Its automorphism group is isomorphic to $PSL(2,41)$. Its existence can be explained neither by a transitivity argument, nor by the Assmus-Mattson theorem.
In this work, we generalize the four circulant construction for self-dual codes. By applying the constructions over the alphabets F_2, F_2 + uF_2, F_4+uF_4, we were able to obtain extremal binary self-dual codes of lengths 40, 64 including new extremal binary self-dual codes of length 68. More precisely, 43 new extremal binary self-dual codes of length 68, with rare new parameters have been constructed.
We introduce an altered version of the four circulant construction over group rings for self-dual codes. We consider this construction over the binary field, the rings F_2 + uF_2 and F_4 + uF_4; using groups of order 3, 7, 9, 13, and 15. Through these constructions and their extensions, we find binary self-dual codes of lengths 32, 40, 56, 64, 68 and 80, all of which are extremal or optimal. In particular, we find five new self-dual codes of parameters [56, 28, 10], twenty-three extremal binary self-dual codes of length 68 with new weight enumerators and fifteen new self-dual codes of paramete…
In this work, quadratic double and quadratic bordered double circulant constructions are applied to F_4 + uF_4 as well as F_4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension theorems as well as the ring extension version are used to obtain 7 extremal self-dual binary codes of length 58, 24 extremal self-dual binary codes of length 66 and 29 extremal self-dual binary codes of length 68, all with new weight enumerators, updating the list of all the known extremal self-dual codes in the literature.
In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs.
In this paper we construct two new symmetric designs with parameters 2-(176,50,14) as designs invariant under certain subgroups of the full automorphism group of the Higman design. One is self-dual and has the full automorphism group of size 11520 and other is not self-dual and has the full automorphism group of size 2520.
In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring R_2 new extremal binary self-dual codes of lengths 64 are constructed as Gray images. More precisely, we construct 15 new codes of length 64. Moreover, 10 new codes of length 66 were obtained by applying a building-up construction to the binary codes. Codes with these weight enumerators are constructed for the first time in the literature. The results are t…
In this work, we apply the idea of composite matrices arising from group rings to derive a number of different techniques for constructing self-dual codes over finite commutative Frobenius rings. By applying these techniques over different alphabets, we construct best known singly-even binary self-dual codes of lengths 80, 84 and 96 as well as doubly-even binary self-dual codes of length 96 that were not known in the literature before.
In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated wreath products of several symmetric groups. Interestingly, some of the codes we consider also arise in the context of regular lattice graphs and permutation decoding.
An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given.
Symmetric 2$-$(36,15,6) designs with an automorphism of order two
本文完成了所有容许二阶自同构的对称 2-(36,15,6) 设计的分类，共发现 1,547,701 个非同构设计，并计算了其关联矩阵张成的三元线性码，发现了具有未知重量分布的近极值自对偶码。
The extremal 3-modular lattice $[\pm G_2(3)]_{14}$ with automorphism group $C_2 \times G_2(\F_3) $ is the unique dual strongly perfect lattice of dimension 14.
Exact and asymptotic enumeration of unrestricted binary phylogenetic networks through automorphism weights
本文通过自同构权重对无限制二元系统发育网络进行精确与渐近计数，提出递归方法，给出k≤5的闭式计数，并证明非树-子网络占比及随机网络非平凡自同构概率的渐近结果。
The Automorphism Group of the Finitary Power Monoid of the Integers under Addition
本文研究整数加法下非空有限子集族构成的幺半群ℙₚᵢₙ(ℤ)的自同构群，基于Tringali和Yan的工作确定其自同构，证明该群同构于2阶循环群与无限二面体群的直积。
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an infinite sequence of binary relations which encode the action of the automorphism. We then explicitly characterize generic automorphisms in terms of properties of this structure. Two notable such properties are ultrahomogeneity, and universality for a certain class of finite structures in this language. As this auxiliary structure seems to be new, we also address…
An abstract polytope is chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. There are still few examples of chiral polytopes, and few constructions that can create chiral polytopes with specified properties. In this paper, we show how to build self-dual chiral polytopes using the mixing construction for polytopes.
We find a sharp bound for the order of the automorphism group of a stable curve of genus $g$ with $3g-3$ nodes, and a sharp bound for the order of the automorphism group of such a curve with all smooth components. Combined with the results of our article math.CO/0608645 we find that graph theoretically, the cubic graph with a given number of vertices and most automorphisms is simple, but algebro-geometrically, the stable curves with $3g-3$ nodes that have the most automorphisms have non-simple dual graph.
We report the number of semigroups with 9 elements up to isomorphism or anti-isomorphism to be 52,989,400,714,478 and up to isomorphism to be 105,978,177,936,292. We obtained these results by combining computer search with recently published formulae for the number of nilpotent semigroups of degree 3. We further provide a complete account of the automorphism groups of the semigroups with at most 9 elements. We use this information to deduce that there are 148,195,347,518,186 distinct associative binary operations on an 8-element set and 38,447,365,355,811,944,462 on a 9-element set.
Let D be the support design of the minimum weight of an extremal binary doubly even self-dual [24m,12m,4m+4] code. In this note, we consider the case when D becomes a t-design with t \geq 6.
Automorphisms of the boundary complex of $\overline{\mathcal{M}}_{0, n}(\mathbb{P}^r, d)$
研究$\overline{\mathcal{M}}_{0, n}(\mathbb{P}^r, d)$边界复形的自同构群，发现当$d\geq2$时，自同构群同构于对称群$\mathbb{S}_n$，而$d=1$时同构于$\mathbb{S}_{n+1}$。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。