首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
We consider the question whether, given a countable family of lattices (Γj)jJ in a locally compact abelian group G, there exist functions (gj)jJ such that the resulting generalized shift-invariant system (gj(??γ))jJ,γΓj is a tight frame of L2(G). This paper develops a new approach to the study of generalized shift-invariant system via almost periodic functions, based on a novel unconditional convergence property. From this theory, we derive characterizing relations for tight and dual frame generators, we introduce the system bandwidth as a measure of the total bandwidth a generalized shift-invariant system can carry, and we show that the so-called Calderón sum is uniformly bounded from below for generalized shift-invariant frames. Without the unconditional convergence property, we show, counter intuitively, that even orthonormal bases can have arbitrary small system bandwidth. Our results show that the question of existence of frame generators for a general lattice system is rather subtle and depends on analytical and algebraic properties of the lattice system.  相似文献   

2.
3.
4.
5.
6.
7.
8.
《Discrete Mathematics》2022,345(10):113004
Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, V(H) can be partitioned into A and B such that H[A] is perfect and ω(H[B])<ω(H). We use Pt and Ct to denote a path and a cycle on t vertices, respectively. For two disjoint graphs F1 and F2, we use F1F2 to denote the graph with vertex set V(F1)V(F2) and edge set E(F1)E(F2), and use F1+F2 to denote the graph with vertex set V(F1)V(F2) and edge set E(F1)E(F2){xy|xV(F1) and yV(F2)}. In this paper, we prove that (i) (P5,C5,K2,3)-free graphs are perfectly divisible, (ii) χ(G)2ω2(G)?ω(G)?3 if G is (P5,K2,3)-free with ω(G)2, (iii) χ(G)32(ω2(G)?ω(G)) if G is (P5,K1+2K2)-free, and (iv) χ(G)3ω(G)+11 if G is (P5,K1+(K1K3))-free.  相似文献   

9.
In this paper, we generalize the notion of functional graph. Specifically, given an equation E(X,Y)=0 with variables X and Y over a finite field Fq of odd characteristic, we define a digraph by choosing the elements in Fq as vertices and drawing an edge from x to y if and only if E(x,y)=0. We call this graph as equational graph. In this paper, we study the equational graph when choosing E(X,Y)=(Y2f(X))(λY2f(X)) with f(X) a polynomial over Fq and λ a non-square element in Fq. We show that if f is a permutation polynomial over Fq, then every connected component of the graph has a Hamiltonian cycle. Moreover, these Hamiltonian cycles can be used to construct balancing binary sequences. By making computations for permutation polynomials f of low degree, it appears that almost all these graphs are strongly connected, and there are many Hamiltonian cycles in such a graph if it is connected.  相似文献   

10.
We study the presence of L-orthogonal elements in connection with Daugavet centers and narrow operators. We prove that if dens(Y)?ω1 and G:X?Y is a Daugavet center with separable range then, for every non-empty w?-open subset W of BX??, it follows that G??(W) contains some L-orthogonal to Y. In the context of narrow operators, we show that if X is separable and T:X?Y is a narrow operator, then given yBX and any non-empty w?-open subset W of BX?? then W contains some L-orthogonal u so that T??(u)=T(y). In the particular case that T?(Y?) is separable, we extend the previous result to dens(X)=ω1. Finally, we prove that none of the previous results holds in larger density characters (in particular, a counterexample is shown for ω2 under the assumption 2c=ω2).  相似文献   

11.
12.
13.
Let R(x)=g(x)/h(x) be a rational expression of degree three over the finite field Fq. We count the irreducible polynomials in Fq[x], of a given degree, that have the form h(x)degff(R(x)) for some f(x)Fq[x]. As an example of application of our results, we recover the number of irreducible transformation shift registers of order three, which were computed by Jiang and Yang in 2017.  相似文献   

14.
15.
Let Fq be the finite field of order q. Let G be one of the three groups GL(n,Fq), SL(n,Fq) or U(n,Fq) and let W be the standard n-dimensional representation of G. For non-negative integers m and d we let mWdW? denote the representation of G given by the direct sum of m vectors and d covectors. We exhibit a minimal set of homogeneous invariant polynomials {?1,?2,,?(m+d)n}?Fq[mWdW?]G such that Fq(mWdW?)G=Fq(?1,?2,,?(m+d)n) for all cases except when md=0 and G=GL(n,Fq) or SL(n,Fq).  相似文献   

16.
For the Schur superalgebra S=S(m|n,r) over a ground field K of characteristic zero, we define the symmetrizer Tλ[i:j] of the ordered pairs of tableaux (Ti,Tj) of the shape λ. We show that the K-span Aλ,K of all symmetrizers Tλ[i:j] has a basis consisting of Tλ[i:j] for Ti and Tj semistandard. In particular, Aλ,K0 if and only if λ is an (m|n)-hook partition. In this case, the S-superbimodule Aλ,K is identified as Dλ?KDλo, where Dλ and Dλo are left and right irreducible S-supermodules of the highest weight λ.We define modified symmetrizers Tλ{i:j} and show that their Z-span forms a Z-form Aλ,Z of Aλ,Q. We show that every modified symmetrizer Tλ{i:j} is a Z-linear combination of modified symmetrizers Tλ{i:j} for Ti,Tj semistandard. Using modular reduction to a field K of characteristic p>2, we obtain that Aλ,K has a basis consisting of modified symmetrizers Tλ{i:j} for Ti and Tj semistandard.  相似文献   

17.
18.
《Discrete Mathematics》2022,345(5):112805
Given a graph H and an integer k?2, let fk(n,H) be the smallest number of colors C such that there exists a proper edge-coloring of the complete graph Kn with C colors containing no k vertex-disjoint color isomorphic copies of H. In this paper, we prove that f2(n,Ht)=Ω(n1+12t?3) where Ht is the 1-subdivision of the complete graph Kt. This answers a question of Conlon and Tyomkyn (2021) [4].  相似文献   

19.
20.
We consider the real-valued differential equation
x(t)=f(x(t),x(t?d(xt)))
with state-dependent delay, where f is strictly monotonic in its second argument. We describe a class of such equations for which a version of the Poincaré–Bendixson theorem holds.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号