Truncation error estimates for generalized Hermite sampling

The generalized Hermite sampling uses samples from the function itself and its derivatives up to order r. In this paper, we investigate truncation error estimates for the generalized Hermite sampling series on a complex domain for functions from Bernstein space. We will extend some known techniques to derive those estimates and the bounds of Jagerman (SIAM J. Appl. Math. 14, 714–723 1966), Li (J. Approx. Theory 93, 100–113 1998), Annaby-Asharabi (J. Korean Math. Soc. 47, 1299–1316 2010), and Ye and Song (Appl. Math. J. Chinese Univ. 27, 412–418 2012) will be special cases for our results. Some examples with tables and figures are given at the end of the paper.     

A contribution to perturbation analysis for total least squares problems

In this note, we present perturbation analysis for the total least squares (Tls) problems under the genericity condition. We review the three condition numbers proposed respectively by Zhou et al. (Numer. Algorithm, 51 (2009), pp. 381–399), Baboulin and Gratton (SIAM J. Matrix Anal. Appl. 32 (2011), pp. 685–699), Li and Jia (Linear Algebra Appl. 435 (2011), pp. 674–686). We also derive new perturbation bounds.     

Finiteness results for lattices in certain Lie groups

In this note we establish some general finiteness results concerning lattices Γ in connected Lie groups G which possess certain “density” properties (see Moskowitz, M., On the density theorems of Borel and Furstenberg, Ark. Mat. 16 (1978), 11–27, and Moskowitz, M., Some results on automorphisms of bounded displacement and bounded cocycles, Monatsh. Math. 85 (1978), 323–336). For such groups we show that Γ always has finite index in its normalizer N _G (Γ). We then investigate analogous questions for the automorphism group Aut(G) proving, under appropriate conditions, that Stab_Aut(G)(Γ) is discrete. Finally we show, under appropriate conditions, that the subgroup \(\tilde{\Gamma}=\{i_{\gamma}:\gamma \in \Gamma \},\ i_{\gamma}(x)=\gamma x\gamma^{-1}\), of Aut(G) has finite index in Stab_Aut(G)(Γ). We test the limits of our results with various examples and counterexamples.     

On bigraded regularities of Rees algebra

For any homogeneous ideal I in \(K[x_1,\ldots ,x_n]\) of analytic spread \(\ell \), we show that for the Rees algebra R(I), \({\text {reg}}_{(0,1)}^{\mathrm{syz}}(R(I))={\text {reg}}_{(0,1)}^{\mathrm{T}}(R(I))\). We compute a formula for the (0, 1)-regularity of R(I), which is a bigraded analog of Theorem 1.1 of Aramova and Herzog (Am. J. Math. 122(4) (2000) 689–719) and Theorem 2.2 of Römer (Ill. J. Math. 45(4) (2001) 1361–1376) to R(I). We show that if the defect sequence, \(e_k:= {\text {reg}}(I^k)-k\rho (I)\), is weakly increasing for \(k \ge {\text {reg}}^{\mathrm{syz}}_{(0,1)}(R(I))\), then \({\text {reg}}(I^j)=j\rho (I)+e\) for \(j \ge {\text {reg}}^{\mathrm{syz}}_{(0,1)}(R(I))+\ell \), where \(\ell ={\text {min}}\{\mu (J)~|~ J\subseteq I \text{ a } \text{ graded } \text{ minimal } \text{ reduction } \text{ of } I\}\). This is an improvement of Corollary 5.9(i) of [16].     

A Quantum Analog of Generalized Cluster Algebras

We define a quantum analog of a class of generalized cluster algebras which can be viewed as a generalization of quantum cluster algebras defined in Berenstein and Zelevinsky (Adv. Math. 195(2), 405–455 2005). In the case of rank two, we extend some structural results from the classical theory of generalized cluster algebras obtained in Chekhov and Shapiro (Int. Math. Res. Notices 10, 2746–2772 2014) and Rupel (2013) to the quantum case.     

Preconditioning of spectral methods via Birkhoff interpolation

High-order differentiation matrices as calculated in spectral collocation methods usually include a large round-off error and have a large condition number (Baltensperger and Berrut Computers and Mathematics with Applications 37(1), 41–48 1999; Baltensperger and Trummer SIAM J. Sci. Comput. 24(5), 1465–1487 2003; Costa and Don Appl. Numer. Math. 33(1), 151–159 2000). Wang et al. (Wang et al. SIAM J. Sci. Comput. 36(3), A907–A929 2014) present a method to precondition these matrices using Birkhoff interpolation. We generalize this method for all orders and boundary conditions and allowing arbitrary rows of the system matrix to be replaced by the boundary conditions. The preconditioner is an exact inverse of the highest-order differentiation matrix in the equation; thus, its product with that matrix can be replaced by the identity matrix. We show the benefits of the method for high-order differential equations. These include improved condition number and, more importantly, higher accuracy of solutions compared to other methods.     

Positivity for Generalized Cluster Variables of Affine Quivers

It has been proved in Lee and Schiffler, Ann. of Math. 182(1) 73–125 2015 that cluster variables of all skew-symmetric cluster algebras are positive. i.e., every cluster variable as a Laurent polynomial in the cluster variables of any fixed cluster has positive coefficients. We prove that every regular generalized cluster variable of an affine quiver is positive. As a corollary, we obtain that generalized cluster variables of affine quivers are positive and we also construct various positive bases. This generalizes the results in Dupont, J. Algebra Appl. 11(4) 19 2012 and Ding et al. Algebr. Represent. Theory 16(2) 491–525 2013.     

Semisimple Representations of Alternating Cyclotomic Hecke Algebras

We define alternating cyclotomic Hecke algebras in higher levels as subalgebras of cyclotomic Hecke algebras under an analogue of Goldman’s hash involution. We compute the rank of these algebras and construct a full set of irreducible representations in the semisimple case, generalising Mitsuhashi’s results Mitsuhashi (J. Alg. 240 535–558 2001, J. Alg. 264 231–250 2003).     

Prediction of catastrophes in space over time

Predicting rare events, such as high level up-crossings, for spatio-temporal processes plays an important role in the analysis of the occurrence and impact of potential catastrophes in, for example, environmental settings. Designing a system which predicts these events with high probability, but with few false alarms, is clearly desirable. In this paper an optimal alarm system in space over time is introduced and studied in detail. These results generalize those obtained by de Maré (Ann. Probab. 8, 841–850, 1980) and Lindgren (Ann. Probab. 8, 775–792, 1980, Ann. Probab. 13, 804–824, 1985) for stationary stochastic processes evolving in continuous time and are applied here to stationary Gaussian random fields.     

Generalized sinc-Gaussian sampling involving derivatives

The generalized sampling expansion which uses samples from a bandlimited function f and its first r derivatives was first introduced by Linden and Abramson (Inform. Contr. 3, 26–31, 1960) and it was extended in different situations by some authors through the last fifty years. The use of the generalized sampling series in approximation theory is limited because of the slow convergence. In this paper, we derive a modification of a generalized sampling involving derivatives, which is studied by Shin (Commun. Korean Math. Soc. 17, 731–740, 2002), using a Gaussian multiplier. This modification is introduced for wider classes, the class of entire functions including unbounded functions on ? and the class of analytic functions in a strip. It highly improves the convergence rate of the generalized sampling which will be of exponential order. We will show that many known results included in Sampl. Theory Signal Image Process. 9, 199–221 (2007) and Numer. Funct. Anal. Optim. 36, 419–437 (2015) are special cases of our results. Numerical examples show a rightly good agreement with our theoretical analysis.     

Computationally efficient modular nonlinear filter stabilization for high Reynolds number flows

The nonlinear filter based stabilization proposed in Layton et al. (J. Math. Fluid Mech. 14(2), 325–354 2012) allows to incorporate an eddy viscosity model into an existing laminar flow codes in a modular way. However, the proposed nonlinear filtering step requires the assembly of the associated matrix at each time step and solving a linear system with an indefinte matrix. We propose computationally efficient version of the filtering step that only requires the assembly once, and the solution of two symmetric, positive definite systems at each time step. We also test a new indicator function based on the entropy viscosity model of Guermond (Int. J. Numer. Meth. Fluids. 57(9), 1153–1170 2008); Guermond et al. (J. Sci. Comput. 49(1), 35–50 2011).     

A hybrid viscosity iterative method with averaged mappings for split equilibrium problems and fixed point problems

In this paper, with the help of averaged mappings, we introduce and study a hybrid iterative method to approximate a common solution of a split equilibrium problem and a fixed point problem of a finite collection of nonexpansive mappings. We prove that the sequences generated by the iterative scheme strongly converges to a common solution of the above-said problems. We give some numerical examples to ensure that our iterative scheme is more efficient than the methods of Plubtieng and Punpaeng (J. Math Anal. Appl. 336(1), 455–469, 15), Liu (Nonlinear Anal. 71(10), 4852–4861, 10) and Wen and Chen (Fixed Point Theory Appl. 2012(1), 1–15, 18). The results presented in this paper are the extension and improvement of the recent results in the literature.     

$${\varvec{\mathcal {}}}$$-minimaxness and local cohomology modules

Let R be a commutative Noetherian ring, \({\mathfrak {a}}\) an ideal of R, M a finitely generated R-module, and \({\mathcal {S}}\) a Serre subcategory of the category of R-modules. We introduce the concept of \({\mathcal {S}}\)-minimax R-modules and the notion of the \({\mathcal {S}}\)-finiteness dimension

$$\begin{aligned} f_{\mathfrak {a}}^{{\mathcal {S}}}(M):=\inf \lbrace f_{\mathfrak {a}R_{\mathfrak {p}}}(M_{\mathfrak {p}}) \vert \mathfrak {p}\in {\text {Supp}}_R(M/ \mathfrak {a}M) \text { and } R/\mathfrak {p}\notin {\mathcal {S}} \rbrace \end{aligned}$$

and we will prove that: (i) If \({\text {H}}_{\mathfrak {a}}^{0}(M), \cdots ,{\text {H}}_{\mathfrak {a}}^{n-1}(M)\) are \({\mathcal {S}}\)-minimax, then the set \(\lbrace \mathfrak {p}\in {\text {Ass}}_R( {\text {H}}_{\mathfrak {a}}^{n}(M)) \vert R/\mathfrak {p}\notin {\mathcal {S}}\rbrace \) is finite. This generalizes the main results of Brodmann–Lashgari (Proc Am Math Soc 128(10):2851–2853, 2000), Quy (Proc Am Math Soc 138:1965–1968, 2010), Bahmanpour–Naghipour (Proc Math Soc 136:2359–2363, 2008), Asadollahi–Naghipour (Commun Algebra 43:953–958, 2015), and Mehrvarz et al. (Commun Algebra 43:4860–4872, 2015). (ii) If \({\mathcal {S}}\) satisfies the condition \(C_{\mathfrak {a}}\), then

$$\begin{aligned} f_{\mathfrak {a}}^{{\mathcal {S}}}(M)= \inf \lbrace i\in {\mathbb {N}}_{0} \vert {\text {H}}_{\mathfrak {a}}^{i}(M) \text { is not } {\mathcal {S}}\hbox {-}minimax\rbrace . \end{aligned}$$

This is a formulation of Faltings’ Local-global principle for the \({\mathcal {S}}\)-minimax local cohomology modules. (iii) \( \sup \lbrace i\in {\mathbb {N}}_{0} \vert {\text {H}}_{\mathfrak {a}}^{i}(M) \text { is not } {\mathcal {S}}\text {-minimax} \rbrace = \sup \lbrace i\in {\mathbb {N}}_{0} \vert {\text {H}}_{\mathfrak {a}}^{i}(M) \text { is not in } {\mathcal {S}} \rbrace \).

     

Limit theorems for counting variables based on records and extremes

Hsu and Robbins (Proc. Nat. Acad. Sci. USA 33, 25–31, 1947) introduced the concept of complete convergence as a complement to the Kolmogorov strong law, in that they proved that \( {\sum }_{n=1}^{\infty } P(|S_{n}|>n\varepsilon )<\infty \) provided the mean of the summands is zero and that the variance is finite. Later, Erd?s proved the necessity. Heyde (J. Appl. Probab. 12, 173–175, 1975) proved that, under the same conditions, \(\lim _{\varepsilon \searrow 0} \varepsilon ^{2}{\sum }_{n=1}^{\infty } P(| S_{n}| \geq n\varepsilon )=EX^{2}\), thereby opening an area of research which has been called precise asymptotics. Both results above have been extended and generalized in various directions. Some time ago, Kao proved a pointwise version of Heyde’s result, viz., for the counting process \(N(\varepsilon ) ={\sum }_{n=1}^{\infty }1\hspace *{-1.0mm}\text {{I}} \{|S_{n}|>n\varepsilon \}\), he showed that \(\lim _{\varepsilon \searrow 0} \varepsilon ^{2} N(\varepsilon )\overset {d}{\to } E\,X^{2}{\int }_{0}^{\infty } 1\hspace *{-1.0mm}\text {I}\{|W(u)|>u\}\,du\), where W(?) is the standard Wiener process. In this paper we prove analogs for extremes and records for i.i.d. random variables with a continuous distribution function.     

<Emphasis Type="Italic">l</Emphasis><Subscript>1</Subscript>-<Emphasis Type="Italic">l</Emphasis><Subscript>2</Subscript> regularization of split feasibility problems

Numerous problems in signal processing and imaging, statistical learning and data mining, or computer vision can be formulated as optimization problems which consist in minimizing a sum of convex functions, not necessarily differentiable, possibly composed with linear operators and that in turn can be transformed to split feasibility problems (SFP); see for example Censor and Elfving (Numer. Algorithms 8, 221–239 1994). Each function is typically either a data fidelity term or a regularization term enforcing some properties on the solution; see for example Chaux et al. (SIAM J. Imag. Sci. 2, 730–762 2009) and references therein. In this paper, we are interested in split feasibility problems which can be seen as a general form of Q-Lasso introduced in Alghamdi et al. (2013) that extended the well-known Lasso of Tibshirani (J. R. Stat. Soc. Ser. B 58, 267–288 1996). Q is a closed convex subset of a Euclidean m-space, for some integer m ≥ 1, that can be interpreted as the set of errors within given tolerance level when linear measurements are taken to recover a signal/image via the Lasso. Inspired by recent works by Lou and Yan (2016), Xu (IEEE Trans. Neural Netw. Learn. Syst. 23, 1013–1027 2012), we are interested in a nonconvex regularization of SFP and propose three split algorithms for solving this general case. The first one is based on the DC (difference of convex) algorithm (DCA) introduced by Pham Dinh Tao, the second one is nothing else than the celebrate forward-backward algorithm, and the third one uses a method introduced by Mine and Fukushima. It is worth mentioning that the SFP model a number of applied problems arising from signal/image processing and specially optimization problems for intensity-modulated radiation therapy (IMRT) treatment planning; see for example Censor et al. (Phys. Med. Biol. 51, 2353–2365, 2006).     

Comparison of graphs associated to a commutative Artinian ring

Let R be a commutative ring with \(1\ne 0\) and the additive group \(R^+\). Several graphs on R have been introduced by many authors, among zero-divisor graph \(\Gamma _1(R)\), co-maximal graph \(\Gamma _2(R)\), annihilator graph AG(R), total graph \( T(\Gamma (R))\), cozero-divisors graph \(\Gamma _\mathrm{c}(R)\), equivalence classes graph \(\Gamma _\mathrm{E}(R)\) and the Cayley graph \(\mathrm{Cay}(R^+ ,Z^*(R))\). Shekarriz et al. (J. Commun. Algebra, 40 (2012) 2798–2807) gave some conditions under which total graph is isomorphic to \(\mathrm{Cay}(R^+ ,Z^*(R))\). Badawi (J. Commun. Algebra, 42 (2014) 108–121) showed that when R is a reduced ring, the annihilator graph is identical to the zero-divisor graph if and only if R has exactly two minimal prime ideals. The purpose of this paper is comparison of graphs associated to a commutative Artinian ring. Among the results, we prove that for a commutative finite ring R with \(|\mathrm{Max}(R)|=n \ge 3\), \( \Gamma _1(R) \simeq \Gamma _2(R)\) if and only if \(R\simeq \mathbb {Z}^n_2\); if and only if \(\Gamma _1(R) \simeq \Gamma _\mathrm{E}(R)\). Also the annihilator graph is identical to the cozero-divisor graph if and only if R is a Frobenius ring.     

Fast convergence of an inexact interior point method for horizontal complementarity problems

In Andreani et al. (Numer. Algorithms 57:457–485, 2011), an interior point method for the horizontal nonlinear complementarity problem was introduced. This method was based on inexact Newton directions and safeguarding projected gradient iterations. Global convergence, in the sense that every cluster point is stationary, was proved in Andreani et al. (Numer. Algorithms 57:457–485, 2011). In Andreani et al. (Eur. J. Oper. Res. 249:41–54, 2016), local fast convergence was proved for the underdetermined problem in the case that the Newtonian directions are computed exactly. In the present paper, it will be proved that the method introduced in Andreani et al. (Numer. Algorithms 57:457–485, 2011) enjoys fast (linear, superlinear, or quadratic) convergence in the case of truly inexact Newton computations. Some numerical experiments will illustrate the accuracy of the convergence theory.     

On a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings

In 1971, Pazy [Israel J. Math. 9 (1971), 235–240] presented a beautiful trichotomy result concerning the asymptotic behaviour of the iterates of a nonexpansive mapping. In this note, we analyze the fixedpoint- free case in more detail. Our results and examples give credence to the conjecture that the iterates always converge cosmically. The relationship to recent work by Lins [Proc. Amer. Math. Soc. 137 (2009), 2387–2392] is also discussed.     

New error bounds for linear complementarity problems of Nekrasov matrices and <Emphasis Type="Italic">B</Emphasis>-Nekrasov matrices

New error bounds for the linear complementarity problems are given respectively when the involved matrices are Nekrasov matrices and B-Nekrasov matrices. Numerical examples are given to show that the new bounds are better respectively than those provided by García-Esnaola and Peña (Numer. Algor. 67(3), 655–667, 2014 and Numer. Algor. 72(2), 435–445, 2016) in some cases.     

Families of Subsets Without a Given Poset in Double Chains and Boolean Lattices

Given a finite poset P, the intensively studied quantity La(n, P) denotes the largest size of a family of subsets of [n] not containing P as a weak subposet. Burcsi and Nagy (J. Graph Theory Appl. 1, 40–49 2013) proposed a double-chain method to get an upper bound \({\mathrm La}(n,P)\le \frac {1}{2}(|P|+h-2)\left (\begin {array}{c}n \\ \lfloor {n/2}\rfloor \end {array}\right )\) for any finite poset P of height h. This paper elaborates their double-chain method to obtain a new upper bound

$${\mathrm La}(n,P)\le \left( \frac{|P|+h-\alpha(G_{P})-2}{2}\right)\left( \begin{array}{c}n \\ \lfloor{\frac{n}{2}}\rfloor\end{array}\right) $$

for any graded poset P, where α(G _P ) denotes the independence number of an auxiliary graph defined in terms of P. This result enables us to find more posets which verify an important conjecture by Griggs and Lu (J. Comb. Theory (Ser. A) 119, 310–322, 2012).