The noncommutative Wiener lemma, linear independence, and spectral properties of the algebra of time-frequency shift operators

In this paper we analyze the Banach *-algebra of time-frequency shifts with absolutely summable coefficients. We prove a noncommutative version of the Wiener lemma. We also construct a faithful tracial state on this algebra which proves the algebra contains no compact operators. As a corollary we obtain a special case of the Heil-Ramanathan-Topiwala conjecture regarding linear independence of finitely many time-frequency shifts of one function. We also estimate the coefficient decay of the inverse of finite linear combinations of time-frequency shifts.

     

Linear Independence of Gabor Systems in Finite Dimensional Vector Spaces

We discuss the linear independence of systems ofmvectors in n-dimensional complex vector spaces where the m vectors are time-frequency shifts of one generating vector. Such systems are called Gabor systems. When n is prime, we show that there exists an open, dense subset with full-measure of such generating vectors with the property that any subset of n vectors in the corresponding full Gabor system of n² vectors is linearly independent. We derive consequences relevant to coding, operator identification and time-frequency analysis in general.     

Linear independence of digamma function and a variant of a conjecture of Rohrlich

Let ψ(x) denote the digamma function. We study the linear independence of ψ(x) at rational arguments over algebraic number fields. We also formulate a variant of a conjecture of Rohrlich concerning linear independence of the log gamma function at rational arguments and report on some progress. We relate these conjectures to non-vanishing of certain L-series.     

On the Structure of the Set of E-Functions Satisfying Linear Differential Equations of Second Order

We prove a special case of Siegel's conjecture concerning the representability of E-functions in the form of polynomials in hypergeometric functions. We prove several assertions (formulated earlier by A. B. Shidlovskii) about the transcendence and linear independence of values of E-functions.     

Independence Sequences of Well-Covered Graphs: Non-Unimodality and the Roller-Coaster Conjecture

A graph G is well-covered provided each maximal independent set of vertices has the same cardinality. The term s_k of the independence sequence (s₀,s₁,,s) equals the number of independent k-sets of vertices of G. We investigate constraints on the linear orderings of the terms of the independence sequence of well-covered graphs. In particular, we provide a counterexample to the recent unimodality conjecture of Brown, Dilcher, and Nowakowski. We formulate the Roller-Coaster Conjecture to describe the possible linear orderings of terms of the independence sequence. We are grateful to Jason Brown for a helpful discussion in December of 1999 and to Richard Stanley for valuable feedback in August of 2000. The work of the second author was partially supported by the Naval Academy Research Council and ONR grant N0001400WR20041     

Upper bounds on the independence and the clique covering number

New upper bounds for the independence number and for the clique covering number of a graph are given in terms of the rank, respectively the eigenvalues, of the adjacency matrix. We formulate a conjecture concerning an upper bound of the clique covering number. This upper bound is related to an old conjecture of Alan J. Hoffman which is shown to be false. Key words: adjacency matrix, eigenvalues, independence number, clique covering number. AMS classification: 05C.     

Nonnegative jordan bases

In this paper we are concerned with the problem of when the generalized eigenspace of an n × n nonegative matrix A corresponding to its spectrai radius ρ has a nonnegative Jordan basis. Richman and Schneider have shown this to hold when, and only when, the Weyr characteristics of A corresponding to ρ is equal to the vector of levels in the singular graph of A Here we develop sufficient conditions for this equality to hold based upon the linear independence of a certain set of vectors which are generated according to a process of elimination of totally independent chains from the singular graph. We show that this condition comes close to being a further characterization for the existence of a nonnegative Jordan basis for this eigenspace and actually conjecture that this is the case. Finally, we show that this eigenspace has a Rothblum basis which is a Jordan basis if and only if the singular graph is a disjoint union of chains.     

On unlinking of continuous statistics of normal sample

This paper contains a theorem connected with Y. V. Linnik’s conjecture on conditions of independence of a pair of normal sample statistics, which are continuous and homogeneous. These properties are significant for the problem, as it is seen from the proof.     

Jack vertex operators and realization of Jack functions

We give an iterative method to realize general Jack functions using vertex operators. We first prove some cases of Stanley’s conjecture on positivity of the Littlewood–Richardson coefficients, and then use this method to give a new realization of Jack functions. We also show in general that the images of coefficients of products of Jack vertex operators form a basis of symmetric functions. In particular, this gives a new proof of linear independence for the rectangular and marked rectangular Jack vertex operators. Finally, a generalized Frobenius formula for Jack functions is given and used for evaluation of Dyson integrals and even powers of Vandermonde determinants.     

On the independence property of first order theories and indiscernible sequences

We refute the strong version of Shelah’s conjecture about models of large cardinalities, the independence property, and indiscernible sequences. We find necessary and sufficient conditions for a theory to lack the independence property and present applications of these conditions.     

Stability and Independence for Multivariate Refinable Distributions

Due to their so-called time-frequency localization properties, wavelets have become a powerful tool in signal analysis and image processing. Typical constructions of wavelets depend on the stability of the shifts of an underlying refinable function. In this paper, we derive necessary and sufficient conditions for the stability of the shifts of certain compactly supported refinable functions. These conditions are in terms of the zeros of the refinement mask. Our results are actually applicable to more general distributions which are not of function type, if we generalize the notion of stability appropriately. We also provide a similar characterization of the (global) linear independence of the shifts. We present several examples illustrating our results, as well as one example in which known results on box splines are derived using the theorems of this paper.     

Algebraic independence of the values ofE-functions at singular points and Siegel’s conjecture

We prove a generalization of Shidlovskii’s theorem on the algebraic independence of the values ofE-functions satisfying a system of linear differential equations that is well known in the theory of transcendental numbers. We consider the case in which the values ofE-functions are taken at singular points of these systems. Using the obtained results, we prove Siegel’s conjecture that, for the case of first-order differential equations, anyE-function satisfying a linear differential equation is representable as a polynomial in hypergeometricE-functions. Translated fromMatematicheskie Zametki, Vol. 67, No. 2, pp. 174–190, February, 2000.     

Mathematical background for a method on quotient signal decomposition

The blind source separation problem is discussed in this article. Focusing on the assumption of independency of the sources in the time-frequency domain, we present a mathematical formulation for the estimation problem of the number of sources. The proposed method uses the quotient of complex valued time-frequency information of only two observed signals to detect the number of sources. No fewer number of observed signals than the detected number of sources is needed to separate sources. The assumption on sources is quite general independence in the time-frequency plane, which is different from that of independent component analysis. We propose algorithms with feedback and give numerical simulations to show the method works well even for noisy case.     

On a packing problem for infinite graphs and independence spaces

In this paper several infinite extensions of the well-known results for packing bases in finite matroids are considered. A counterexample is given to a conjecture of Nash-Williams on edge-disjoint spanning trees of countable graphs, and a sufficient condition is proved for the packing problem in independence spaces over a countably infinite set.     

Semigroups of matrices of intermediate growth

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.     

Extension and Restriction Principles for the HRT Conjecture

The HRT (Heil–Ramanathan–Topiwala) conjecture asks whether a finite collection of time-frequency shifts of a non-zero square integrable function on \(\mathbb {R}\) is linearly independent. This longstanding conjecture remains largely open even in the case when the function is assumed to be smooth. Nonetheless, the conjecture has been proved for some special families of functions and/or special sets of points. The main contribution of this paper is an inductive approach to investigate the HRT conjecture based on the following. Suppose that the HRT is true for a given set of N points and a given function. We identify the set of all new points such that the conjecture remains true for the same function and the set of \(N+1\) points obtained by adding one of these new points to the original set. To achieve this we introduce a real-valued function whose global maximizers describe when the HRT is true. To motivate this new approach we re-derive a special case of the HRT for sets of 3 points. Subsequently, we establish new results for points in (1, n) configurations, and for a family of symmetric (2, 3) configurations. Furthermore, we use these results and the refinements of other known ones to prove that the HRT holds for certain families of 4 points.

     

向量组线性相关性的教学方法与技巧

向量组线性相关性是线性代数教学中的一项重要内容．由于概念比较抽象、定理难以理解,因此一直是线性代数教学环节中的一项难点．通过对向量组线性相关性的定义以及判断方法进行了形象的描述,建立向量组线性相关性与矩阵、线性方程组之间的关系,有利于学生理解向量组线性相关性的真正内涵与简便求解方法．     

On a lower bound for the connectivity of the independence complex of a graph

Aharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of the independence complex of a graph. They conjectured that this bound is optimal for every graph. We give two different arguments which show that the conjecture is false.     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

Very simple theories without forking

We prove Vaught's conjecture for minimal trivial simple theories satisfying the generalized independence theorem. Research supported by KBN grant 2 P03A 006 09