Quintasymptotic primes and four results of Schenzel

Let I be an ideal in a Noetherian ring R, let (I)_a be the integral closure of I, and let S be a multiplicatively closed subset of R. Let T₁, T₂, and T₃ be the topologies given by the filtrations {Iⁿ R_S ∩ R | n ≥ 1}, {Iⁿ | n ≥ 1}, and {(Iⁿ)_a | n ≥ 1}. We g results due to Schenzel, characterizing when T₁ is either equivalent or linearly equivalent to either of T₂ or T₃. The characterizations involve the sets of essential primes of I, quintessential primes of I, asymptotic primes of I, and quintasymptotic primes of I.     

Fixed points and iterations of mean-type mappings

Let (X, d) be a metric space and T: X → X a continuous map. If the sequence (T ⁿ ) _n∈? of iterates of T is pointwise convergent in X, then for any x ∈ X, the limit $$\mu _T (x) = \mathop {\lim }\limits_{n \to \infty } T^n (x)$$ is a fixed point of T. The problem of determining the form of µ _T leads to the invariance equation µ _T ○ T = µ _T , which is difficult to solve in general if the set of fixed points of T is not a singleton. We consider this problem assuming that X = I ^p , where I is a real interval, p ≥ 2 a fixed positive integer and T is the mean-type mapping M =(M ₁,...,M _p ) of I ^p . In this paper we give the explicit forms of µ_M for some classes of mean-type mappings. In particular, the classical Pythagorean harmony proportion can be interpreted as an important invariance equality. Some applications are presented. We show that, in general, the mean-type mappings are not non-expansive.     

Boundary representations and rigidity of submodules

This paper considers two problems on the Fock type spaces Fs (0<s?1). Firstly, it is shown that on the space Fs (0<s<1), the identity representation of C^∗(I,T₁,…,Tn) is a boundary representation for the Banach subalgebra B(I,T₁,…,Tn), while on the space F₁, it is not. Secondly, it is shown that all the submodules of F₁ are rigid.     

Forbidden Configurations and Product Constructions

A simple matrix is a (0,1)-matrix with no repeated columns. For a (0,1)-matrix F, we say that a (0,1)-matrix A has F as a configuration if there is a submatrix of A which is a row and column permutation of F (trace is the set system version of a configuration). Let \({\|A\|}\) denote the number of columns of A. We define \({{\rm forb}(m, F) = {\rm max}\{\|A\| \,:\, A}\) is m-rowed simple matrix and has no configuration F. We extend this to a family \({\mathcal{F} = \{F_1, F_2, \ldots , F_t\}}\) and define \({{\rm forb}(m, \mathcal{F}) = {\rm max}\{\|A\| \,:\, A}\) is m-rowed simple matrix and has no configuration \({F \in \mathcal{F}\}}\) . We consider products of matrices. Given an m ₁ × n ₁ matrix A and an m ₂ × n ₂ matrix B, we define the product A × B as the (m ₁ + m ₂) × n ₁ n ₂ matrix whose columns consist of all possible combinations obtained from placing a column of A on top of a column of B. Let I _k denote the k × k identity matrix, let \({I_k^{c}}\) denote the (0,1)-complement of I _k and let T _k denote the k × k upper triangular (0,1)-matrix with a 1 in position i, j if and only if i ≤ j. We show forb(m, {I ₂ × I ₂, T ₂ × T ₂}) is \({\Theta(m^{3/2})}\) while obtaining a linear bound when forbidding all 2-fold products of all 2 × 2 (0,1)-simple matrices. For two matrices F, P, where P is m-rowed, let \({f(F, P) = {\rm max}_{A} \{\|A\| \,:\,A}\) is m-rowed submatrix of P with no configuration F}. We establish f(I ₂ × I ₂, I _m/2 × I _m/2) is \({\Theta(m^{3/2})}\) whereas f(I ₂ × T ₂, I _m/2 × T _m/2) and f(T ₂ × T ₂, T _m/2 × T _m/2) are both \({\Theta(m)}\) . Additional results are obtained. One of the results requires extensive use of a computer program. We use the results on patterns due to Marcus and Tardos and generalizations due to Klazar and Marcus, Balogh, Bollobás and Morris.     

Trigonometric polynomials with many real zeros

This is a contribution to the theory of “incomplete trigonometric polynomials”T _n , but mainly for the case when their zeros are not concentrated at just one point, but are distributed in some intervalI whose length is not too large. We begin with the simple theorem that if ∥T _n ∥ ≤ 1 and ifT _n has ≥θn, 0<θ< 2, zeros at 0, thenT _n (t) must be small on the interval |t|<2 arcsin (θ/2). There are similar but more complicated and more difficult to prove results whenT _n has ≥θn zeros onI. These results have the following application: IfT _n →f a.e., and if ∥T _n >∥_∞<-1, thenf vanishes on a set of the circleT whose measure is controlled by lim sup (N _n /n), whereN _n is the number of zeros ofT _n onT. In turn, this has further applications to series of polynomials, to norms of Lagrange operators, and to Hardy classes.     

Monotonicity of permanents of certain doubly stochastic circulant matrices

Let p_k(A), k=2,…,n, denote the sum of the permanents of all k×k submatrices of the n×n matrix A. A conjecture of Ðokovi?, which is stronger than the famed van der Waerden permanent conjecture, asserts that the functions p_k((1?θ)J_n+;θA), k=2,…, n, are strictly increasing in the interval 0?θ?1 for every doubly stochastic matrix A. Here J_n is the n×n matrix all whose entries are equal $\text{1}\text{n}$. In the present paper it is proved that the conjecture holds true for the circulant matrices A=αI_n+ βP_n, α, β?0, α+;β=1, and $\text{A=}\text{(nJ}{}_{\mathrm{n}}\text{?I}{}_{\mathrm{n}}\text{?P}{}_{\mathrm{n}}\text{)}\text{(n?2)}$, where I_n and P_n are respectively the n×n identify matrix and the n×n permutation matrix with 1's in positions (1,2), (2,3),…, (n?1, n), (n, 1).     

Weak and strong convergence to common fixed points of non-self nonexpansive mappings

SupposeK is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach spaceE withP as a nonexpansive retraction. LetT ₁,T ₂ andT ₃:K → E be nonexpansive mappings with nonempty common fixed points set. Letα _n ,β _n ,γ _n ,α _n ^′ ,β _n ^′ ,γ _n ^′ ,α _n ^′′ ,β _n ^′′ andγ _n ^′′ be real sequences in [0, 1] such thatα _n +β _n +γ _n =α _n ^′ +β _n ^′ +γ _n ^′ =α _n ^′′ +β _n ^′′ +γ _n ^′′ = 1, starting from arbitraryx ₁ ∈ K, define the sequencex _n by $$\left\{ \begin{gathered} z_n = P(\alpha ''_n T_1 x_n + \beta ''_n x_n + \gamma ''_n w_n ) \hfill \\ y_n = P(\alpha _n^\prime T_2 z_n + \beta _n^\prime x_n + \gamma _n^\prime v_n ) \hfill \\ x_{n + 1} = P(\alpha _n T_3 y_n + \beta _n x_n + \gamma _n u_n ) \hfill \\ \end{gathered} \right.$$ with the restrictions $\sum\limits_{n = 1}^\infty {\gamma _n }< \infty , \sum\limits_{n = 1}^\infty \gamma _n^\prime< \infty ,\sum\limits_{n = 1}^\infty {\gamma ''_n }< \infty $ . (i) If the dual E* ofE has the Kadec-Klee property, then weak convergence of ax _n to somex* ∈ F(T ₁) ∩F(T ₂) ∩ (T ₃) is proved; (ii) IfT ₁,T₂ andT ₃ satisfy condition (A′), then strong convergence ofx _n to some x* ∈F(T ₁) ∩F(T ₂) ∩ (T ₃) is obtained.     

Characteristic functions and joint invariant subspaces

Let T:=[T₁,…,Tn] be an n-tuple of operators on a Hilbert space such that T is a completely non-coisometric row contraction. We establish the existence of a “one-to-one” correspondence between the joint invariant subspaces under T₁,…,Tn, and the regular factorizations of the characteristic function ΘT associated with T. In particular, we prove that there is a non-trivial joint invariant subspace under the operators T₁,…,Tn, if and only if there is a non-trivial regular factorization of ΘT. We also provide a functional model for the joint invariant subspaces in terms of the regular factorizations of the characteristic function, and prove the existence of joint invariant subspaces for certain classes of n-tuples of operators.We obtain criteria for joint similarity of n-tuples of operators to Cuntz row isometries. In particular, we prove that a completely non-coisometric row contraction T is jointly similar to a Cuntz row isometry if and only if the characteristic function of T is an invertible multi-analytic operator.     

On orthogonal matrices with constant diagonal

In connection with the problem of finding the best projections of k-dimensional spaces embedded in n-dimensional spaces Hermann König asked: Given m∈$\text{R}$ and n∈$\text{N}$, are there n×n matrices C=(c_ij), i, j=1,…,n, such that c_ii=m for all i, |c_ij|=1 for i≠j, and C²=(m²+n?1)I_n? König was especially interested in symmetric C, and we find some families of matrices satisfying this condition. We also find some families of matrices satisfying the less restrictive condition CC^T=(m²+n?1)I_n.     

The determinant of the sum of two normal matrices with prescribed eigenvalues

Given complex numbers α₁,...,α_n, β₁,...,β_n, what can we say about the determinant of A+B, where A (B) is an n×n normal matrix with eigenvalues α₁,...,α_n (β₁,...,β_n)? Some partial answers are offered to this question.     

Weak consistency of least-squares estimators in linear models

Let Y_n, n≥1, be a sequence of integrable random variables with EY_n = x_n1β₁ + x_n2β₂ + … + x_npβ_p, where the x_ij's are known and β^T = (β₁, β₂,…, β_p) unknown. Let b_n be the least-squares estimator of β based on Y₁, Y₂,…, Y_n. Weak consistency of b_n, n≥1, has been considered in the literature under the assumption that each Y_n is square integrable. In this paper, we study weak consistency of b_n, n≥1, and associated rates of convergence under the minimal assumption that each Y_n is integrable.     

Multiplicative mappings at some points on matrix algebras

Let M_n be the algebra of all n×n matrices, and let φ:M_n→M_n be a linear mapping. We say that φ is a multiplicative mapping at G if φ(ST)=φ(S)φ(T) for any S,T∈M_n with ST=G. Fix G∈M_n, we say that G is an all-multiplicative point if every multiplicative linear bijection φ at G with φ(I_n)=I_n is a multiplicative mapping in M_n, where I_n is the unit matrix in M_n. We mainly show in this paper the following two results: (1) If G∈M_n with detG=0, then G is an all-multiplicative point in M_n; (2) If φ is an multiplicative mapping at I_n, then there exists an invertible matrix P∈M_n such that either φ(S)=PSP^-1 for any S∈M_n or φ(T)=PT^trP^-1 for any T∈M_n.     

Existence of Tchebycheff extensions

Given a Tchebycheff System {y_o ··· y_n} defined on an interval I, it is proved that there exists a function y_n+1, such that the system {y_o ··· y_n, y_n+1} is a Tchebycheff System on I. A function such as y_n+1 is called a Tchebycheff extension of the system {y_i}ⁿ_{(i = 0)}.     

Isomorphism Checking of I-graphs

We consider the class of I-graphs, which is a generalization of the class of the generalized Petersen graphs. We show that two I-graphs I(n, j, k) and I(n, j ₁, k ₁) are isomorphic if and only if there exists an integer a relatively prime to n such that either {j ₁, k ₁} =? {a j mod n, a k mod n } or {j ₁, k ₁} =? {a j mod n, ? a k mod n }. This result has an application in the enumeration of non-isomorphic I-graphs and unit-distance representations of generalized Petersen graphs.     

Nonhomogeneous spectra of numbers

A simple characterization is given of those sequences of integersM_n={a_i}ⁿ_i=1for which there exist real numbers αandβ such thata_i=?iα+β?(1?i?n). In addition, for givenM_n, an open intervalI_nis computed such that α?I_nif and only ifa_i=?iα+β?(1?i?n)for suitableβ=β(α).     

Infinite Server Queues with Synchronized Departures Driven by a Single Point Process

We analyze an infinite-server queueing model with synchronized arrivals and departures driven by the point process {T _n } according to the following rules. At time T _n , a single customer (or a batch of size β _n ) arrives to the system. The service requirement of the ith customer in the nth batch is σ _i,n . All customers enter service immediately upon arrival but each customer leaves the system at the first epoch of the point process {T _n } which occurs after his service requirement has been satisfied. For this system the queue length process and the statistics of the departing batches of customers are investigated under various assumptions for the statistics of the point process {T _n }, the incoming batch sequence {β _n }, and the service sequence {σ _i,n }. Results for the asymptotic distribution of the departing batches when the service times are long compared to the interarrival times are also derived.     

Necessary and sufficient conditions for boundedness of some commutators with weighted Lipschitz functions

In this paper we show that b∈Lipβ,μ if and only if the commutator [b,T] of the multiplication operator by b and the singular integral operator T is bounded from Lp(μ) to Lq(μ1−q), where 1<p<q<∞, 0<β<1 and 1/q=1/p−β/n. Also we will obtain that b∈Lipβ,μ if and only if the commutator [b,Iα] of the multiplication operator by b and the fractional integral operator Iα is bounded from Lp(μ) to Lr(μ1−(1−α/n)r), where 1<p<∞, 0<β<1 and 1/r=1/p−(β+α)/n with 1/p>(β+α)/n.     

Asymptotic behaviour of multiperiodic functions scaled by Pisot numbers

Let β > 1 be a Pisot number andg be a positive Hölder continuous function with period one and g(0) = 1. The multiperiodic functionG(ξ)=Π _n=0 ^∞ g(ξ/βⁿ) is studied and the asymptotic behaviour ofI _G(T) = ∫ ₀ ^T G(ξ)dξ investigated. We prove that the limit of logI(T)/ logT exists asT tends to infinity. We also provide a method to calculate this limit for the caseg(ξ) = cos² 2πξ, corresponding to the Fourier transform of the Bernoulli convolution associated to the golden number (or some of its generalizations).     

Ramsey regions

Let (T₁,T₂,…,T_c) be a fixed c-tuple of sets of graphs (i.e. each T_i is a set of graphs). Let R(c,n,(T₁,T₂,…,T_c)) denote the set of all n-tuples, (a₁,a₂,…,a_n), such that every c-coloring of the edges of the complete multipartite graph, K_a1,a2,…,an, forces a monochromatic subgraph of color i from the set T_i (for at least one i). If N denotes the set of non-negative integers, then R(c,n,(T₁,T₂,…,T_c))⊆Nⁿ. We call such a subset of Nⁿ a “Ramsey region”. An application of Ramsey's Theorem shows that R(c,n,(T₁,T₂,…,T_c)) is non-empty for n?0. For a given c-tuple, (T₁,T₂,…,T_c), known results in Ramsey theory help identify values of n for which the associated Ramsey regions are non-empty and help establish specific points that are in such Ramsey regions. In this paper, we develop the basic theory and some of the underlying algebraic structure governing these regions.     

Depths and Cohen–Macaulay properties of path ideals

Given a tree T on n vertices, there is an associated ideal I   of R[_x1,…,_xn]$R[x_1,\dots ,x_n]$ generated by all paths of a fixed length ? of T  . We classify all trees for which R/I$R/I$ is Cohen–Macaulay, and we show that an ideal I whose generators correspond to any collection of subtrees of T satisfies the König property. Since the edge ideal of a simplicial tree has this form, this generalizes a result of Faridi. Moreover, every square-free monomial ideal can be represented (non-uniquely) as a subtree ideal of a graph, so this construction provides a new combinatorial tool for studying square-free monomial ideals.