紧支集分布和可加细向量的整平移的线性相关性

In this paper, the global and local linear independence of any compactly supported distributions by using time domain spaces ,and of refinable vectors by invariant linear spaces are investigated.     

The potential of greed for independence

The well‐known lower bound on the independence number of a graph due to Caro (Technical Report, Tel‐Aviv University, 1979) and Wei (Technical Memorandum, TM 81 ‐ 11217 ‐ 9, Bell Laboratories, 1981) can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so‐called potential functions p_G: V(G)→?₀ defined on the vertex set of a graph G for which suitably modified versions of the greedy algorithms applied to G yield independent sets I with . We provide examples of such potentials, which lead to bounds improving the bound due to Caro and Wei. Furthermore, suitably adapting the randomized algorithm we give a short proof of Thiele's lower bound on the independence number of a hypergraph (T. Thiele, J Graph Theory 30 (1999), 213–221).     

数域上的线性无关性

本文给出一组复数在数域上线性无关的一个判别法则及它对于超越数论的一个应用．     

Linear independence of time-frequency translates

The refinement equation plays a key role in wavelet theory and in subdivision schemes in approximation theory. Viewed as an expression of linear dependence among the time-scale translates of , it is natural to ask if there exist similar dependencies among the time-frequency translates of . In other words, what is the effect of replacing the group representation of induced by the affine group with the corresponding representation induced by the Heisenberg group? This paper proves that there are no nonzero solutions to lattice-type generalizations of the refinement equation to the Heisenberg group. Moreover, it is proved that for each arbitrary finite collection , the set of all functions such that is independent is an open, dense subset of . It is conjectured that this set is all of .

     

Linear independence of a finite set of time-frequency shifts

This paper introduces an open conjecture in time-frequency analysis on the linear independence of a finite set of time-frequency shifts of a given L² function. Firstly, background and motivation for the conjecture are provided. Secondly, the main progress of this linear independence in the past twenty five years is reviewed. Finally, the partial results of the high dimensional case and other cases for the conjecture are briefly presented.     

Linear independence and divided derivatives of a Drinfeld module II

In this note we extend our previous results on the linear independence of values of the divided derivatives of exponential and quasi-periodic functions related to a Drinfeld module to divided derivatives of values of identity and quasi-periodic functions evaluated at the logarithm of an algebraic value. The change in point of view enables us to deal smoothly with divided derivatives of arbitrary order. Moreover we treat a full complement of quasi-periodic functions corresponding to a basis of de Rham cohomology.

     

数域上的线性无关性(Ⅱ)

本文给出了文[1](见本刊中文版, 1997,40(5):713-716)中建立的复数在数域上线性无关的判别法则的一个等价形式,并将它应用于某些幂级数和三角级数的超越性研究.     

Relating broadcast independence and independence

An independent broadcast on a connected graph $G$ is a function $f:V\left(G\right)\to {\mathbb{N}}_0$ such that, for every vertex $x$ of $G$, the value $f\left(x\right)$ is at most the eccentricity of $x$ in $G$, and $f\left(x\right)>0$ implies that $f\left(y\right)=0$ for every vertex $y$ of $G$ within distance at most $f\left(x\right)$ from $x$. The broadcast independence number ${\alpha }_b\left(G\right)$ of $G$ is the largest weight $\sum _{x\in V\left(G\right)}f\left(x\right)$ of an independent broadcast $f$ on $G$. Clearly, ${\alpha }_b\left(G\right)$ is at least the independence number $\alpha \left(G\right)$ for every connected graph $G$. Our main result implies ${\alpha }_b\left(G\right)\le 4\alpha \left(G\right)$. We prove a tight inequality and characterize all extremal graphs.     

Exponential independence

For a set $S$ of vertices of a graph $G$, a vertex $u$ in $V\left(G\right)?S$, and a vertex $v$ in $S$, let ${\mathrm{dist}}_{(G,S)}(u,v)$ be the distance of $u$ and $v$ in the graph $G?(S?\left\{v\right\})$. Dankelmann et al. (2009) define $S$ to be an exponential dominating set of $G$ if $w_{(G,S)}\left(u\right)\ge 1$ for every vertex $u$ in $V\left(G\right)?S$, where $w_{(G,S)}\left(u\right)={\sum }_{v\in S}{\left(\frac{1}{2}\right)}^{{\mathrm{dist}}_{(G,S)}(u,v)?1}$. Inspired by this notion, we define $S$ to be an exponential independent set of $G$ if $w_{(G,S?\left\{u\right\})}\left(u\right)<1$ for every vertex $u$ in $S$, and the exponential independence number ${\alpha }_e\left(G\right)$ of $G$ as the maximum order of an exponential independent set of $G$.Similarly as for exponential domination, the non-local nature of exponential independence leads to many interesting effects and challenges. Our results comprise exact values for special graphs as well as tight bounds and the corresponding extremal graphs. Furthermore, we characterize all graphs $G$ for which ${\alpha }_e\left(H\right)$ equals the independence number $\alpha \left(H\right)$ for every induced subgraph $H$ of $G$, and we give an explicit characterization of all trees $T$ with ${\alpha }_e\left(T\right)=\alpha \left(T\right)$.     

Linear independence of refinable distributions supported on [0, 2]×[0, 2]

In this paper a necessary and sufficient condition on symbol is given for linear independence of refinable distributions supported on [0,2]×[0,2]. This project is partially supported by the National Natural Science Foundation of China (No. 69735020), the Tian Tuan Foundation, the Doctoral Bases Promotion Foundation of National Educational Commission of China (No. 97033519) and the Zhejiang Provincial Science Foundation of China (No. 196038).     

Nonlinearity creates linear independence

Any number of linearly independent plane waves can be obtained by scaling, shifting and/or rotating a plane wave created from an activation function. We investigate the condition which ensures linear independence of the plane waves. In the case all the three procedures are combined, the linear independence can be proved by ad hoc methods for most of commonly used activation functions. The result can be used for proving structural uniqueness of neural networks and for implementing finite mapping by neural networks.This paper was supported in part by Grant 07252213 from Ministry of Education and Culture, Japan.     

On the Linear Stability of Splitting Methods

A comprehensive linear stability analysis of splitting methods is carried out by means of a 2×2 matrix K(x) with polynomial entries (the stability matrix) and the stability polynomial p(x) (the trace of K(x) divided by two). An algorithm is provided for determining the coefficients of all possible time-reversible splitting schemes for a prescribed stability polynomial. It is shown that p(x) carries essentially all the information needed to construct processed splitting methods for numerically approximating the evolution of linear systems. By conveniently selecting the stability polynomial, new integrators with processing for linear equations are built which are orders of magnitude more efficient than other algorithms previously available. This paper is dedicated to Arieh Iserles on the occasion of his 60th anniversary.     

Algebraic independence of certain numbers

In this note the algebraic independence of values of general Mahler series with different parameters at algebraic points is established. Supported by the Fok Ying Tung Education Foundation and the National Natural Science Foundation of China     

具有边界控制的线性Timoshenko型系统的指数稳定性

研究多孔弹性材料在实际应用中的稳定性问题.多孔物体的动力学行为由线性Timoshenko型方程描述,这样的系统一般只是渐近稳定但不指数稳定,假定系统在一端简单支撑,另一端自由,在自由端对系统施加边界反馈控制,讨论闭环系统的适定性和指数稳定性.首先,证明了由闭环系统决定的算子A是预解紧的耗散算子、生成C0压缩半群,从而得到了系统的适定性.进一步通过对系统算子A的本征值的渐近值估计,得到算子谱分布在一个带域,相互分离的,模充分大的本征值都是A的简单本征值.通过引入一个辅助算子A0,利用算子A0的谱性质以及算子A与A0之间的关系,得到了A的广义本征向量的完整性以及Riesz基性质.最后利用Riesz基性质和谱分布得到闭环系统的指数稳定性.     

Logical and algorithmic properties of stable conditional independence

The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated. We utilize recent results concerning a complete axiomatization of stable conditional independence relative to discrete probability measures to derive perfect model properties of stable conditional independence structures. We show that stable CI can be interpreted as a generalization of Markov networks and establish a connection between sets of stable CI statements and propositional formulas in conjunctive normal form. Consequently, we derive that the implication problem for stable CI is coNP-complete. Finally, we show that Boolean satisfiability (SAT) solvers can be employed to efficiently decide the implication problem and to compute concise, non-redundant representations of stable CI, even for instances involving hundreds of random variables.     

Algebraic independence by approximation method

By the use of approximation method a general criterion of algebraic independence of complex numbers is established. As its application the algebraic independence of values of certain gap series at algebraic and transcendental points is given. Subject supported by the National Natural Science Foundation of China     

Linear independence of certain numbers

Archiv der Mathematik - Let $$k\ge 2$$, $$b\ge 2$$ and $$1\le a_1&lt;\cdots     

Efficiency of the independence assumption in the combination of forecasts

In seeking to minimise the composite forecast error variance of a linear combination of forecasts, contradictory suggestions have been reported concerning the practice of making the assumption of independence between forecast errors. This assumption can introduce robustness though its avoidance of sampling errors in the estimation of correlation coefficient(s), although it does render the composite forecast theoretically suboptimal. By means of theory and experimental simulation, this paper examines the circumstances whereby the independence assumption may produce more efficient composite forecasts. Its applicability is shown to depend both upon the underlying correlation structure and relative size of forecast errors as well as the observation base available for estimation.     

Delay-Dependent Stability of Linear Multistep Methods for Neutral Systems with Distributed Delays

This paper considers the asymptotic stability of linear multistep (LM) methods for neutral systems with distributed delays. In particular, several sufficient conditions for delay-dependent stability of numerical solutions are obtained based on the argument principle. Compound quadrature formulae are used to compute the integrals. An algorithm is proposed to examine the delay-dependent stability of numerical solutions. Several numerical examples are performed to verify the theoretical results.