共查询到20条相似文献,搜索用时 265 毫秒
1.
2.
3.
In this work we give a characterization of Galois Linear Complementary Dual codes and Galois-invariant codes over mixed alphabets of finite chain rings, which leads to the study of the Gray image of -linear codes, where and that provides LCD codes over . 相似文献
5.
《Discrete Mathematics》2022,345(4):112767
Let R be a finite commutative chain ring, be the dihedral group of size 2n and be the dihedral group ring. In this paper, we completely characterize left ideals of (called left -codes) when . In this way, we explore the structure of some skew-cyclic codes of length 2 over R and also over , where S is an isomorphic copy of R. As a particular result, we give the structure of cyclic codes of length 2 over R. In the case where is a Galois field, we give a classification for left -codes over , for any positive integer N. In both cases we determine dual codes and identify self-dual ones. 相似文献
6.
7.
8.
9.
10.
《Discrete Mathematics》2022,345(10):113004
Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, can be partitioned into A and B such that is perfect and . We use and to denote a path and a cycle on t vertices, respectively. For two disjoint graphs and , we use to denote the graph with vertex set and edge set , and use to denote the graph with vertex set and edge set . In this paper, we prove that (i) -free graphs are perfectly divisible, (ii) if G is -free with , (iii) if G is -free, and (iv) if G is -free. 相似文献
11.
13.
14.
We prove the existence of solutions to the nonlinear Schrödinger equation in with a magnetic potential . Here V represents the electric potential, the index p is greater than 1. Along some sequence tending to zero we exhibit complex-value solutions that concentrate along some closed curves. 相似文献
15.
16.
《Discrete Mathematics》2022,345(8):112903
Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number is the least integer k for which G admits a coloring with k colors such that each color class induces a -degenerate subgraph of G. So is the chromatic number and is the point arboricity. The point partition number with was introduced by Lick and White. A graph G is called -critical if every proper subgraph H of G satisfies . In this paper we prove that if G is a -critical graph whose order satisfies , then G can be obtained from two non-empty disjoint subgraphs and by adding t edges between any pair of vertices with and . Based on this result we establish the minimum number of edges possible in a -critical graph G of order n and with , provided that and t is even. For the corresponding two results were obtained in 1963 by Tibor Gallai. 相似文献
17.
《Discrete Mathematics》2022,345(9):112945
The coinvariant algebra is a quotient of the polynomial ring whose algebraic properties are governed by the combinatorics of permutations of length n. A word over the positive integers is packed if whenever appears as a letter of w, so does . We introduce a quotient of which is governed by the combinatorics of packed words. We relate our quotient to the generalized coinvariant rings of Haglund, Rhoades, and Shimozono as well as the superspace coinvariant ring. 相似文献
18.
19.
The notion of multiple Ore extension is introduced as a natural generalization of Ore extensions and double Ore extensions. For a PBW-deformation of type quantum group, we explicitly obtain the commutation relations of its root vectors, then show that it can be realized via a series of multiple Ore extensions, which we call a ladder Ore extension of type . Moreover, we analyze the quantum algebras with of type , and and give some examples and counterexamples that can be realized by a ladder Ore extension. 相似文献
20.
We explicitly determine generators of cyclic codes over a non-Galois finite chain ring of length , where p is a prime number and k is a positive integer. We completely classify that there are three types of principal ideals of and four types of non-principal ideals of , which are associated with cyclic codes over of length . We then obtain a mass formula for cyclic codes over of length . 相似文献