函数超越性研究中的若干命题

本文对高师院校教材《初等代数研究》中关于函数超越性研究的问题 ,提出改进的意见及相应的若干命题 .     

John's Decomposition of the Identity in the Non-Convex Case

We prove an extension of the classical John's Theorem, that characterises the ellipsoid of maximal volume position inside a convex body by the existence of some kind of decomposition of the identity, obtaining some results for maximal volume position of a compact and connected set inside a convex set with nonempty interior. By using those results we give some estimates for the outer volume ratio of bodies not necessarily convex.     

Column generation decomposition with the degenerate constraints in the subproblem

In this paper, we propose a new Dantzig–Wolfe decomposition for degenerate linear programs with the non degenerate constraints in the master problem and the degenerate ones in the subproblem. We propose three algorithms. The first one, where some set of variables of the original problem are added to the master problem, corresponds to the Improved Primal Simplex algorithm (IPS) presented recently by Elhallaoui et al. [7]. In the second one, some extreme points of the subproblem are added as columns in the master problem. The third algorithm is a mixed implementation that adds some original variables and some extreme points of a subproblem to the master problem. Experimental results on some degenerate instances show that the proposed algorithms yield computational times that are reduced by an average factor ranging from 3.32 to 13.16 compared to the primal simplex of CPLEX.     

Quantum walks and the size of the graph

A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix quantum walk model, the number of edges is bounded below by a cubic function on the eccentricity of a periodic vertex. This gives some idea on the shape of a graph that would admit periodicity or perfect state transfer. We also raise some extremal type of questions in the end that could lead to future research.     

On some properties of the Laplacian matrix revealed by the RCM algorithm

In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a well-known scheme for numbering the nodes of a network in such a way that the corresponding adjacency matrix has a narrow bandwidth. Inspired by some properties of the eigenvectors of a Laplacian matrix, we derive some properties based on row sums of a Laplacian matrix that was reordered by the RCM algorithm. One of the theoretical results serves as a basis for writing an easy MATLAB code to detect connected components, by using the function “symrcm” of MATLAB. Some examples illustrate the theoretical results.     

Application of the frontal algorithm in the collocation method

The author reports on a numerical experimentation with the collocation finite element procedure using Hermite basis functions and the frontal elimination technique to solve some large-scale problems where up to 1000 linear equations are involved. Several test cases, including some applications to engineering problems, are presented. The implementation of the frontal technique applied to collocation is discussed to some extent.     

A boundary element method for the Dirichlet eigenvalue problem of the Laplace operator

The solution of eigenvalue problems for partial differential operators by using boundary integral equation methods usually involves some Newton potentials which may be resolved by using a multiple reciprocity approach. Here we propose an alternative approach which is in some sense equivalent to the above. Instead of a linear eigenvalue problem for the partial differential operator we consider a nonlinear eigenvalue problem for an associated boundary integral operator. This nonlinear eigenvalue problem can be solved by using some appropriate iterative scheme, here we will consider a Newton scheme. We will discuss the convergence and the boundary element discretization of this algorithm, and give some numerical results.     

Sharp estimates for the anisotropic torsional rigidity and the principal frequency

In this paper we generalize some classical estimates involving the torsional rigidity and the principal frequency of a convex domain to a class of functionals related to some anisotropic nonlinear operators.     

On the multiplicative complexity of the Discrete Fourier Transform

Most results in multiplicative complexity assume that the functions to be computed are in the field of constants extended by indeterminates, that is, the variables satisfy no algebraic relation. In this paper we extend some of the known results to the case that some of the variables do satisfy some algebraic relations. We then apply these results to obtaining a lower bound on the multiplicative complexity of the Discrete Fourier Transform. In the special case of computing the Discrete Fourier Transform of a prime number of points, the lower bound is actually attainable.     

From the 1-2-3 conjecture to the Riemann hypothesis

This survey presents some combinatorial problems with number-theoretic flavor. Our journey starts from a simple graph coloring question, but at some point gets close to dangerous territory of the Riemann Hypothesis. We will mostly focus on open problems, but we will also provide some simple proofs, just for adorning.     

拟相似集的Hausdorff测度的特征

Siegfried GRAF在文献［1］中给出了自相似集上的Hausdorff测度(简称H-测度)的特征.John McLaughlin在文献［2］中引入了拟相似集的概念,K.J.Falconer又在文献［3］中讨论了拟相似集上H-测度和维数的性质.本文研究拟相似集上的H-测度的特征,并得出在一定条件下支撑于其上满足一定条件的测度与H-测度的等价性条件.     

体上线性映射的子空间的维数及其应用

本文给出体上左向量空间的线性映射的某些子空间的维数恒等式,并讨论了它在体上矩阵秩的理论上的应用,其中一个有趣的应用是,由体上矩阵秩的恒等式来刻划体上某些矩阵的特征性质。 以下设Ω是一个体。对Ω上左向量空间V映入Ω上左向量空间V′的线性映射σ:V V~σ,记σ的核空间为:     

On the behaviour of the periodic Coxeter Laplacian in some representations related to the antiferromagnetic asymptotic mode and continual limits

We consider some problems related to the asymptotic behaviour of the so-called periodic Coxeter Laplacian (a distinguished operator in the group algebra of the symmetric group essentially coinciding with the Hamiltonian of the XXX Heisenberg model of spins) in some representations corresponding to the antiferromagnetic asymptotic mode, as well as in some related continual limits. Bibliography: 9 titles.     

二重Laplace-Stieltjes变换的增长性*

本文引入了一种新的广义级来研究由二重Laplace-Stieltjes变换所定义的全纯函数的增长性, 并建立了一些最大模与最大项之间的有趣的关系,推广了Laplace-Stieltjes变换的某些结果.     

关于向量组的秩与最大无关组的教学改革研究

对向量的秩与最大无关组的教学过程进行了分析研究，从教学内容组织与教学手段等方面提出了改革的方案．对有的教材的不足提出了改进办法.     

输电线路阻塞费用的管理

运用多元回归分析法求出了线路有功潮流关于发电机组出力的近似表达式,同时讨论了阻塞费用的计算问题,而后本文对安全解决线路阻塞问题进行了实例研究,把实际问题处理成有约束非线性优化问题,并得到了满意的结果.     

Database and the Micro

The word 'database' has gone through the buzzword stage and has gained currency as a term covering a wide range of related facilities and techniques. Its apearance in the microcomputer world has therefore aroused confusion as well as interest. Most products are, however, aids to data management or solutions to some particular set of data management problems. This paper attempts to deal with some of the issues and problems underlying data management on micros and to review some current offerings on the market.     

On the Extensions Preserving the Shape of a Semi-Hölder Function

We present some results concerning the extension of a semi-Hölder real-valued function defined on a subset of a quasi-metric space, preserving some shape properties: the smallest semi-Hölder constant, the radiantness and the global minimum (maximum) of the extended function.     

J—自共轭微分算子谱的定性分析

本文对J－自共轭微分算子谱理论研究情况做一些概要性的介绍,第一部分简要回顾了J－自共轭微分算子理论研究的发展过程,第二,三部分介绍了J－自共轭微分算子的本质谱和离散谱定性分析的主要方法和结论;第四部分扼要叙述J－自共轭微分算子其它方面的一些工作,以及J－自共轭微分算子谱理论研究中尚待解决的问题。     

Equilibrium of stellar dynamical systems in the context of the Vlasov–Poisson model

This short review is devoted to the problem of the equilibrium of stellar dynamical systems in the context of the Vlasov–Poisson model. In a first part we will review some classical problems posed by the application of the Vlasov–Poisson model to the astrophysical systems like globular clusters or galaxies. In a second part we will recall some recent numerical results which may give us some quantitative hints about the equilibrium state associated to those systems.