共查询到20条相似文献,搜索用时 15 毫秒
1.
Nicolae Popescu Marian Vâjâitu Alexandru Zaharescu 《Algebras and Representation Theory》2006,9(1):47-66
Let T be a transcendental element of
and
the orbit of T. On
we have a Haar measure
. The goal of this paper is to characterize all the elements of
for which the integral
, called the trace of T, is well defined.Presented by A. Verschoren 相似文献
2.
Alan H. Mekler 《Order》1992,9(2):159-162
A linear order isscattered if it contains no copy of the rationals. The scattered subsets of
form a better quasi-order under embeddability via order automorphisms.Research supported by NSERC grant #9848. 相似文献
3.
In this paper we study the problem of adaptive estimation of a multivariate function satisfying some structural assumption. We propose a novel estimation procedure that adapts simultaneously to unknown structure and smoothness of the underlying function. The problem of structural adaptation is stated as the problem of selection from a given collection of estimators. We develop a general selection rule and establish for it global oracle inequalities under arbitrary ${\mathbb{L}}_p$ -losses. These results are applied for adaptive estimation in the additive multi-index model. 相似文献
4.
5.
We determine exact values for the k-error linear complexity L
k
over the finite field
of the Legendre sequence
of period p and the Sidelnikov sequence
of period p
m
− 1. The results are
for 1 ≤ k ≤ (p
m
− 3)/2 and
for k≥ (p
m
− 1)/2. In particular, we prove
相似文献
6.
We study self-dual codes over the rings
and
. We define various weights and weight enumerators over these rings and describe the groups of invariants for each weight enumerator over the rings. We examine the torsion codes over these rings to describe the structure of self-dual codes. Finally we classify self-dual codes of small lengths over
. 相似文献
7.
8.
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. 相似文献
9.
10.
Hai Q. Dinh Abhay Kumar Singh Sukhamoy Pattanayak Songsak Sriboonchitta 《Designs, Codes and Cryptography》2018,86(7):1451-1467
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. 相似文献
11.
Rational proper holomorphic maps from the unit ball in ?2 into the unit ball ? N with degree 2 are classified, up to automorphisms of balls. 相似文献
12.
A Gizatullin surface is a normal affine surface V over $ \mathbb{C} $ , which can be completed by a zigzag; that is, by a linear chain of smooth rational curves. In this paper we deal with the question of uniqueness of $ \mathbb{C}^{ * } $ -actions and $ \mathbb{A}^{{\text{1}}} $ -fibrations on such a surface V up to automorphisms. The latter fibrations are in one to one correspondence with $ \mathbb{C}_{{\text{ + }}} $ -actions on V considered up to a “speed change”. Non-Gizatullin surfaces are known to admit at most one $ \mathbb{A}^{1} $ -fibration V → S up to an isomorphism of the base S. Moreover, an effective $ \mathbb{C}^{ * } $ -action on them, if it does exist, is unique up to conjugation and inversion t $ \mapsto $ t ?1 of $ \mathbb{C}^{ * } $ . Obviously, uniqueness of $ \mathbb{C}^{ * } $ -actions fails for affine toric surfaces. There is a further interesting family of nontoric Gizatullin surfaces, called the Danilov-Gizatullin surfaces, where there are in general several conjugacy classes of $ \mathbb{C}^{ * } $ -actions and $ \mathbb{A}^{{\text{1}}} $ -fibrations, see, e.g., [FKZ1]. In the present paper we obtain a criterion as to when $ \mathbb{A}^{{\text{1}}} $ -fibrations of Gizatullin surfaces are conjugate up to an automorphism of V and the base $ S \cong \mathbb{A}^{{\text{1}}} $ . We exhibit as well large subclasses of Gizatullin $ \mathbb{C}^{ * } $ -surfaces for which a $ \mathbb{C}^{ * } $ -action is essentially unique and for which there are at most two conjugacy classes of $ \mathbb{A}^{{\text{1}}} $ -fibrations over $ \mathbb{A}^{{\text{1}}} $ . 相似文献
13.
For a prime number p and a finite set S of prime numbers congruent to 1 modulo p, we consider the Galois group of the maximal pro-p-extension unramified outside S over the ${\mathbb Z_p}$ -extension of the rational number field. In this paper, we give a family of S for which the Galois group is a metacyclic pro-p group with an application to Greenberg’s conjecture. 相似文献
14.
Joseph Zaks 《Journal of Geometry》2005,82(1-2):195-203
Benz proved that every mapping
that preserves the distances 1 and 2 is an isometry, provided d ≥ 5. We prove that every mapping
that preserves the distances 1 and
is an isometry, provided d ≥ 5. 相似文献
15.
For a sequence $\underline{u}=(u_n)_{n\in \mathbb{N }}$ of integers, let $t_{\underline{u}}(\mathbb{T })$ be the group of all topologically $\underline{u}$ -torsion elements of the circle group $\mathbb{T }:=\mathbb{R }/\mathbb{Z }$ . We show that for any $s\in ]0,1[$ and $m\in \{0,+\infty \}$ there exists $\underline{u}$ such that $t_{\underline{u}}(\mathbb{T })$ has Hausdorff dimension $s$ and $s$ -dimensional Hausdorff measure equal to $m$ (no other values for $m$ are possible). More generally, for dimension functions $f,g$ with $f(t)\prec g(t), f(t)\prec \!\!\!\prec t$ and $g(t)\prec \!\!\!\prec t$ we find $\underline{u}$ such that $t_{\underline{u}}(\mathbb{T })$ has at the same time infinite $f$ -measure and null $g$ -measure. 相似文献
16.
A. Melakhessou K. Guenda T. A. Gulliver M. Shi P. Solé 《Journal of Applied Mathematics and Computing》2018,57(1-2):375-391
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. 相似文献
17.
M. Bilal J. Borges S. T. Dougherty C. Fern��ndez-C��rdoba 《Designs, Codes and Cryptography》2011,61(1):31-40
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. 相似文献
18.
Summary.
Let
We say that
preserves the distance d 0 if
for each
implies
Let A
n
denote the set of all positive numbers
d such that any map
that preserves unit distance preserves also distance
d.
Let D
n
denote the set of all positive numbers
d with the property: if
and
then there exists a finite set
S
xy
with
such that any map
that preserves unit distance preserves also the distance between
x and y.
Obviously,
We prove:
(1)
(2)
for n 2
D
n
is a
dense subset of
(2) implies that each mapping
f
from
to
(n 2)
preserving unit distance preserves all distances,
if f is continuous with respect to the product topologies
on
and
相似文献
19.