首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 13 毫秒
1.
In this paper, we introduce one-parameter homothetic motions in the generalized complex number plane (\({\mathfrak{p}}\)-complex plane)
$$\mathbb{C}_{J}=\left\{x+Jy:\,\,\, x,y \in \mathbb{R},\quad J^2=\mathfrak{p},\quad \mathfrak{p} \in \{-1,0,1\} \right\} \subset \mathbb{C}_\mathfrak{p}$$
where
$$\mathbb{C}_\mathfrak{p}=\{x+Jy:\,\,\, x,y \in \mathbb{R}, \quad J^2=\mathfrak{p}\}$$
such that \({-\infty < \mathfrak{p} < \infty}\). The velocities, accelerations and pole points of the motion are analysed. Moreover, three generalized complex number planes, of which two are moving and the other one is fixed, are considered and a canonical relative system for one-parameter planar homothetic motion in \({\mathbb{C}_{J}}\) is defined. Euler-Savary formula, which gives the relationship between the curvatures of trajectory curves, during the one-parameter homothetic motions, is obtained with the aim of this canonical relative system.
  相似文献   

2.
3.
In this work, we focus on cyclic codes over the ring \mathbbF2+u\mathbbF2+v\mathbbF2+uv\mathbbF2{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} , which is not a finite chain ring. We use ideas from group rings and works of AbuAlrub et.al. in (Des Codes Crypt 42:273–287, 2007) to characterize the ring (\mathbbF2+u\mathbbF2+v\mathbbF2+uv\mathbbF2)/(xn-1){({{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2})/(x^n-1)} and cyclic codes of odd length. Some good binary codes are obtained as the images of cyclic codes over \mathbbF2+u\mathbbF2+v\mathbbF2+uv\mathbbF2{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} under two Gray maps that are defined. We also characterize the binary images of cyclic codes over \mathbbF2+u\mathbbF2+v\mathbbF2+uv\mathbbF2{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} in general.  相似文献   

4.
In this paper, we give a construction of partial difference sets in p 2 x p 2 x ... x p 2using some finite local rings.Dedicated to Hanfried Lenz on the occasion of his 80th birthdayThe work of this paper was done when the authors visited the University of Hong Kong.  相似文献   

5.
Let R=GR(4,m) be the Galois ring of cardinality 4m and let T be the Teichmüller system of R. For every map λ of T into { -1,+1} and for every permutation Π of T, we define a map φ λ Π of Rinto { -1,+1} as follows: if xR and if x=a+2b is the 2-adic representation of x with xT and bT, then φ λ Π (x)=λ(a)+2Tr(Π(a)b), where Tr is the trace function of R . For i=1 or i=-1, define D i as the set of x in R such thatφ λ Π =i. We prove the following results: 1) D i is a Hadamard difference set of (R,+). 2) If φ is the Gray map of R into ${\mathbb{F}}_2^{2m}$ , then (D i) is a difference set of ${\mathbb{F}}_2^{2m}$ . 3) The set of D i and the set of φ(D i) obtained for all maps λ and Π, both are one-to-one image of the set of binary Maiorana-McFarland difference sets in a simple way. We also prove that special multiplicative subgroups of R are difference sets of kind D i in the additive group of R. Examples are given by means of morphisms and norm in R.  相似文献   

6.
7.
The purpose of the paper is to present new estimates on incomplete character sums in finite fields that are of the strength of Burgess’ celebrated theorem for prime fields. More precisely, an inequality of this type is obtained in Fp2{F_{p^2}} and also for binary quadratic forms, improving on the work of Davenport–Lewis and on several results due to Burgess. The arguments are based on new estimates for the multiplicative energy of certain sets that allow us to improve the amplification step in Burgess’ method.  相似文献   

8.
9.
We prove assorted properties of matrices over ${\mathbb{Z}_{2}}$ , and outline the complexity of the concepts required to prove these properties. The goal of this line of research is to establish the proof complexity of matrix algebra. It also presents a different approach to linear algebra: one that is formal, consisting in algebraic manipulations according to the axioms of a ring, rather than the traditional semantic approach via linear transformations.  相似文献   

10.
In this work, we investigate linear codes over the ring ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ . We first analyze the structure of the ring and then define linear codes over this ring which turns out to be a ring that is not finite chain or principal ideal contrary to the rings that have hitherto been studied in coding theory. Lee weights and Gray maps for these codes are defined by extending on those introduced in works such as Betsumiya et al. (Discret Math 275:43–65, 2004) and Dougherty et al. (IEEE Trans Inf 45:32–45, 1999). We then characterize the ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linearity of binary codes under the Gray map and give a main class of binary codes as an example of ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linear codes. The duals and the complete weight enumerators for ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linear codes are also defined after which MacWilliams-like identities for complete and Lee weight enumerators as well as for the ideal decompositions of linear codes over ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ are obtained.  相似文献   

11.
In this paper, we define the simplex and MacDonald codes of types \(\alpha \) and \(\beta \) over \({\mathbb {Z}}_{2}{\mathbb {Z}}_{4}\). We also examine the covering radii of these codes. Further, we study the binary images of these codes and prove that the binary image of the simplex codes of type \(\alpha \) meets the Gilbert bound.  相似文献   

12.
Isometric embeddings of $\mathbb{Z}_{p^n+1}$ into the Hamming space ( $\mathbb{F}_{p}^{p^n},w$ ) have played a fundamental role in recent constructions of non-linear codes. The codes thus obtained are very good codes, but their rate is limited by the rate of the first-order generalized Reed–Muller code—hence, when n is not very small, these embeddings lead to the construction of low-rate codes. A natural question is whether there are embeddings with higher rates than the known ones. In this paper, we provide a partial answer to this question by establishing a lower bound on the order of a symmetry of ( $\mathbb{F}_{p}^{N},w$ ).  相似文献   

13.
In this paper we will study maximal q-plurisubharmonic functions in ${\mathbb{C}^n}$ . At the same time, we define a notion above weakly q-plurisubharmonic functions and describe the relation between these functions and maximal q-plurisubharmonic functions.  相似文献   

14.
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring \(R=\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}\), where \(v^{3}=v\), for q odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over R. Further, we give bounds on the minimum distance of LCD codes over \(\mathbb {F}_q\) and extend these to codes over R.  相似文献   

15.
16.
We investigate real local isometric immersions of Kähler manifolds ${\mathbb{C}Q^2_c}$ of constant holomorphic curvature 4c into complex projective 3-space. Our main result is that the standard embedding of ${\mathbb{C}P^2}$ into ${\mathbb{C}P^3}$ has strong rigidity under the class of local isometric transformations. We also prove that there are no local isometric immersions of ${\mathbb{C}Q^2_c}$ into ${\mathbb{C}P^3}$ when they have different holomorphic curvature. An important method used is a study of the relationship between the complex structure of any locally isometric immersed ${\mathbb{C}Q^2_c}$ and the complex structure of the ambient space ${\mathbb{C}P^3}$ .  相似文献   

17.
18.
Known upper bounds on the minimum distance of codes over rings are applied to the case of ${\mathbb Z_{2}\mathbb Z_{4}}$ -additive codes, that is subgroups of ${\mathbb Z_{2}^{\alpha}\mathbb Z_{4}^{\beta}}$ . Two kinds of maximum distance separable codes are studied. We determine all possible parameters of these codes and characterize the codes in certain cases. The main results are also valid when ?? = 0, namely for quaternary linear codes.  相似文献   

19.
We study the structure of cyclic DNA codes of odd length over the finite commutative ring \(R=\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2 + v^2\mathbb {F}_2+uv^2\mathbb {F}_2,~u^2=0, v^3=v\), which plays an important role in genetics, bioengineering and DNA computing. A direct link between the elements of the ring R and 64 codons used in the amino acids of living organisms is established by introducing a Gray map from R to \(R_1=\mathbb {F}_2+u\mathbb {F}_2 ~(u^2=0)\). The reversible and the reversible-complement codes over R are investigated. We also discuss the binary image of the cyclic DNA codes over R. Among others, some examples of DNA codes obtained via Gray map are provided.  相似文献   

20.
Complementing the results of (Lotta and Nacinovich, Adv. Math. 191(1): 114–146, 2005), we show that the minimal orbit M of a real form G of a semisimple complex Lie group in a flag manifold is CR-symmetric (see (Kaup and Zaitsev Adv. Math. 149(2):145–181, 2000)) if and only if the corresponding CR algebra admits a gradation compatible with the CR structure.   相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号