On the primitive divisors of the recurrent sequence $$u_{n+1}=(4\rm{cos}^2(2\pi/7)-1)\it{u}_{n}-u_{n-\rm{1}}$$ with applications to group theory

Consider the sequence of algebraic integers u_n given by the starting values u₀ = 0, u₁ = 1 and the recurrence \(u_{n+1}=(4\rm{cos}^2(2\pi/7)-1)\it{u}_{n}-u_{n-\rm{1}}\). We prove that for any n ? {1, 2, 3, 5, 8, 12, 18, 28, 30} the n-th term of the sequence has a primitive divisor in \(\mathbb{Z}[2\rm{cos}(2\pi/7)]\). As a consequence we deduce that for any suffciently large n there exists a prime power q such that the group PSL₂(q) can be generated by a pair x, y with \(x^2=y^3=(xy)^7=1\) and the order of the commutator [x, y] is exactly n. The latter result answers in affrmative a question of Holt and Plesken.     

Inverse Spectral Problem for Analytic {{(\mathbb{Z}/2 \mathbb{Z})^{n}}} -Symmetric Domains in {{\mathbb{R}^{n}}}

We prove that bounded real analytic domains in ${\mathbb{R}^{n}}$ , with the symmetries of an ellipsoid and with one axis length fixed, are determined by their Dirichlet or Neumann eigenvalues among other bounded real analytic domains with the same symmetries and axis length. Some non-degeneracy conditions are also imposed on the class of domains. It follows that bounded, convex analytic domains are determined by their spectra among other such domains. This seems to be the first positive result for the well-known Kac problem, “Can one hear the shape of a drum?”, in higher dimensions.     

A Difference Set in \left( {\mathbb{Z}/4\mathbb{Z}} \right)^3 \times \mathbb{Z}/5\mathbb{Z}

We present a (320, 88, 24)-difference set in , the existence of which was previously open. This new difference set improves a theorem of Davis-Jedwab with the removal of the exceptional case. It also enables us to state a theorem of Schmidt on Davis-Jedwab difference sets more neatly.     

On the distributions of the form ∑i(δpi−δni)

We present some properties of the distributions of the form T=∑_i(δ_pi?δ_ni), with ∑_id(p_i,n_i)<∞, which arise in the 3-d Ginzburg–Landau problem studied by Bourgain, Brezis and Mironescu (C. R. Acad. Sci. Paris, Ser. I 331 (2000) 119–124). We show that there always exists an irreducible representation of T. We also extend a result of Smets (C. R. Acad. Sci. Paris, Ser. I 334 (2002) 371–374) which says that T is a measure iff T can be written as a finite sum of dipoles. To cite this article: A.C. Ponce, C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

关于图Kn-H2n+i(i=1,2)的升分解

Yousef.Alavi等人在文献[1]中定义了一种新分解(Ascending Subgraph Decomposition),即"升分解",并且猜想:任意有正整数条边的图都可以升分解.本文证明了下面两个结论:1. Kn-H2n+1可以升分解,其中H2n+1为含有2n+1条边的Kn的子图;2. Kn-H2n+2可以升分解,其中H2n+2为含有2n+2条边的Kn的子图.     

（n1,n2）型二重（r1,r2）—循环矩阵逆矩阵的插值求法

本文用插值法给出n1n2阶（n1，n2）型二重（r1，r2）－循环矩阵逆矩阵计算公式．     

涉及无限族非扩张映象$\{T_n\}_{n=1}^\infty$的迭代算法$x_{n 1}=\alpha_{n 1}f(x_n) (1-\alpha_{n 1})T_{n 1}x_n$

Under the framework of uniformly smooth Banach spaces, Chang proved in 2006 that the sequence {xn} generated by the iteration xn＋1 =αn＋1f（xn） ＋ （1 - αn＋1）Tn＋1xn converges strongly to a common fixed point of a finite family of nonexpansive maps {Tn}, where f ： C → C is a contraction. However, in this paper, the author considers the iteration in more general case that {Tn} is an infinite family of nonexpansive maps, and proves that Chang＇s result holds still in the setting of reflexive Banach spaces with the weakly sequentially continuous duality mapping.     

Une formule asymptotique pour\sum\limits_{n \leqq x} {a_z (n)d(n + 1)}

Sans résumé     

On the generalized $$text {SO}(2n,{{mathbb {C}}})$$ SO ( 2 n,C ) -opers

Annals of Global Analysis and Geometry - Since their introduction by Beilinson–Drinfeld (Opers, 1993. arXiv math/0501398; Quantization of Hitchin’s integrable system and Hecke...     

Sharp Inequalities Involving $$(n!)^{1/n}$$

We prove that, for all integers \(n\ge 1\),

$$\begin{aligned} \Big (\sqrt{2\pi n}\Big )^{\frac{1}{n(n+1)}}\left( 1-\frac{1}{n+a}\right) <\frac{\root n \of {n!}}{\root n+1 \of {(n+1)!}}\le \Big (\sqrt{2\pi n}\Big )^{\frac{1}{n(n+1)}}\left( 1-\frac{1}{n+b}\right) \end{aligned}$$

and

$$\begin{aligned} \big (\sqrt{2\pi n}\big )^{1/n}\left( 1-\frac{1}{2n+\alpha }\right) <\left( 1+\frac{1}{n}\right) ^{n}\frac{\root n \of {n!}}{n}\le \big (\sqrt{2\pi n}\big )^{1/n}\left( 1-\frac{1}{2n+\beta }\right) , \end{aligned}$$

with the best possible constants

$$\begin{aligned}&a=\frac{1}{2},\quad b=\frac{1}{2^{3/4}\pi ^{1/4}-1}=0.807\ldots ,\quad \alpha =\frac{13}{6} \\&\text {and}\quad \beta =\frac{2\sqrt{2}-\sqrt{\pi }}{\sqrt{\pi }-\sqrt{2}}=2.947\ldots . \end{aligned}$$

     

数列{n/(n!)~(1/n)}极限的教学价值

给出数列{n/(n!)~(1/n)}极限的八种灵活新颖的求解方法,进一步讨论了它的教学价值.     

Perturbation analysis for the positive definite solution of the nonlinear matrix equation X-\sum_{i=1}^{m} A_{i}^{*}X^{-1}A_{i}=Q

Consider the perturbation analysis for positive definite solution of the nonlinear matrix equation $X-\sum_{i=1}^{m}A_{i}^{*}X^{-1}A_{i}=Q$ which arises in an optimal interpolation problem. Two perturbation bounds for the unique positive definite solution are obtained, and an explicit expression of the condition number for the unique positive definite solution is derived. The theoretical results are illustrated by several numerical examples.     

Inequalities for entire functions of exponential type satisfying f(z) \equiv e^{i\gamma } e^{i\tau z} \overline {f(\bar z)}

Let f be an entire function of exponential type satisfying the condition $ f(z) \equiv e^{i\gamma } e^{i\tau z} \overline {f(\bar z)} $ for some real γ. Lower and upper estimates for ∫ _?∞ ^∞ |f′(x)| ^p dx in terms of ∫ _?∞ ^∞ |f(x)| ^p dx, for such a function f belonging to L ^p (R), have been known in the case where p ? [1, ∞) and γ = 0. In this paper, these estimates are shown to hold for any p ? (0, ∞) and any real γ.     

Combinatorics of character formulas for the lie superalgebra \mathfrak{g}\mathfrak{l}\left( {m,n} \right)

Let \mathfrakg \mathfrak{g} be the Lie superalgebra \mathfrakg\mathfrakl( m,n ) \mathfrak{g}\mathfrak{l}\left( {m,n} \right) . Algorithms for computing the composition factors and multiplicities of Kac modules for \mathfrakg \mathfrak{g} were given by the second author, [12] and by J. Brundan [1]. We give a combinatorial proof of the equivalence between the two algorithms. The proof uses weight and cap diagrams introduced by Brundan and C. Stroppel, and cancelations between paths in a graph G \mathcal{G} defined using these diagrams. Each vertex of G \mathcal{G} corresponds to a highest weight of a finite dimensional simple module, and each edge is weighted by a nonnegative integer. If E \mathcal{E} is the subgraph of G \mathcal{G} obtained by deleting all edges of positive weight, then E \mathcal{E} is the graph that describes nonsplit extensions between simple highest weight modules. We also give a procedure for finding the composition factors of any Kac module, without cancelation. This procedure leads to a second proof of the main result.