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.     

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.     

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.     

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.     

Hochschild cohomology and quantum Drinfeld Hecke algebras

Quantum Drinfeld Hecke algebras are generalizations of Drinfeld Hecke algebras in which polynomial rings are replaced by quantum polynomial rings. We identify these algebras as deformations of skew group algebras, giving an explicit connection to Hochschild cohomology. We compute the relevant part of Hochschild cohomology for actions of many reflection groups, and we exploit computations from Naidu et al. (Proc Am Math Soc 139:1553–1567, 2011) for diagonal actions. By combining our work with recent results of Levandovskyy and Shepler (Can J Math 66:874–901, 2014) we produce examples of quantum Drinfeld Hecke algebras. These algebras generalize the braided Cherednik algebras of Bazlov and Berenstein (Selecta Math 14(3–4):325–372, 2009).     

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.     

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.     

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).     

Rigid Binary Relations on a 4-Element Domain

An n-ary relation ρ on a set U is strongly rigid if it is preserved only by trivial operations. It is projective if the only idempotent operations in P o l ρ are projections. Rosenberg, (Rocky Mt. J. Math. 3, 631–639, 1973) characterized all strongly rigid relations on a set with two elements and found a strongly rigid binary relation on every domain U of at least 3 elements. Larose and Tardif (Mult.-Valued Log. 7(5-6), 339–362, 2001) studied the projective and strongly rigid graphs and constructed large families of strongly rigid graphs. ?uczak and Ne?et?il (J. Graph Theory. 47, 81–86, 2004) settled in the affirmative a conjecture of Larose and Tardif that most graphs on a large set are projective, and characterized all homogenous graphs that are projective. ?uczak and Ne?et?il (SIAM J. Comput. 36(3), 835–843, 2006) confirmed a conjecture of Rosenberg that most relations on a big set are strongly rigid. In this paper, we characterize all strongly rigid relations on a set with at least three elements to answer an open question by Rosenberg, (Rocky Mt. J. Math. 3, 631–639, 1973) and we classify the binary relations on the 4-element domain by rigidity and demonstrate that there are merely 40 pairwise nonisomorphic rigid binary relations on the same domain (among them 25 are pairwise nonisomorphic strongly rigid).     

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.     

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.     

On Weighted Kernels of Two Posets

A recent result of Aharoni Berger and Gorelik (Order 31(1), 35–43, 2014) is a weighted generalization of the well-known theorem of Sands Sauer and Woodrow (Theory Ser. B 33(3), 271–275, 1982) on monochromatic paths. The authors prove the existence of a so called weighted kernel for any pair of weighted posets on the same ground set. In this work, we point out that this result is closely related to the stable marriage theorem of Gale and Shapley (Amer. Math. Monthly 69(1), 9–15, 1962), and we generalize Blair’s theorem by showing that weighted kernels form a lattice under a certain natural order. To illustrate the applicability of our approach, we prove further weighted generalizations of the Sands Sauer Woodrow result.     

<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).     

A Complex Analogue of Toda’s Theorem

Toda (SIAM J. Comput. 20(5):865–877, 1991) proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P ^#P , namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result, which illustrates the power of counting, is considered to be a seminal result in computational complexity theory. An analogous result (with a compactness hypothesis) in the complexity theory over the reals (in the sense of Blum–Shub–Smale real machines (Blum et al. in Bull. Am. Math. Soc. 21(1):1–46, 1989) was proved in Basu and Zell (Found. Comput. Math. 10(4):429–454, 2010). Unlike Toda’s proof in the discrete case, which relied on sophisticated combinatorial arguments, the proof in Basu and Zell (Found. Comput. Math. 10(4):429–454, 2010) is topological in nature; the properties of the topological join are used in a fundamental way. However, the constructions used in Basu and Zell (Found. Comput. Math. 10(4):429–454, 2010) were semi-algebraic—they used real inequalities in an essential way and as such do not extend to the complex case. In this paper, we extend the techniques developed in Basu and Zell (Found. Comput. Math. 10(4):429–454, 2010) to the complex projective case. A key role is played by the complex join of quasi-projective complex varieties. As a consequence, we obtain a complex analogue of Toda’s theorem. The results of this paper, combined with those in Basu and Zell (Found. Comput. Math. 10(4):429–454, 2010), illustrate the central role of the Poincaré polynomial in algorithmic algebraic geometry, as well as in computational complexity theory over the complex and real numbers: the ability to compute it efficiently enables one to decide in polynomial time all languages in the (compact) polynomial hierarchy over the appropriate field.     

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.     

Spectral transfer morphisms for unipotent affine Hecke algebras

We classify the spectral transfer morphisms (cf. Opdam in Adv Math 286:912–957, 2016) between affine Hecke algebras associated to the unipotent types of the various inner forms of an unramified absolutely simple algebraic group G defined over a non-archimedean local field k. This turns out to characterize Lusztig’s classification (Lusztig in Int Math Res Not 11:517–589, 1995; in Represent Theory 6:243–289, 2002) of unipotent characters of G in terms of the Plancherel measure, up to diagram automorphisms. As an application of these results, the spectral correspondences associated with such morphisms (Opdam 2016), and some results of Ciubotaru, Kato and Kato [CKK] (also see Ciubotaru and Opdam in A uniform classification of the discrete series representations of affine Hecke algebras. arXiv:1510.07274) we prove a conjecture of Hiraga, Ichino and Ikeda [HII] on formal degrees and adjoint gamma factors in the special case of unipotent discrete series characters of inner forms of unramified simple groups of adjoint type defined over k.     

Harnack Inequality and Applications for Infinite-Dimensional GEM Processes

The dimension-free Harnack inequality and uniform heat kernel upper/lower bounds are derived for a class of infinite-dimensional GEM processes, which was introduced in Feng and Wang (J. Appl. Probab. 44 938–949 2007) to simulate the two-parameter GEM distributions. In particular, the associated Dirichlet form satisfies the super log-Sobolev inequality which strengthens the log-Sobolev inequality derived in Feng and Wang (J. Appl. Probab. 44 938–949 2007). To prove the main results, explicit Harnack inequality and super Poincaré inequality are established for the one-dimensional Wright-Fisher diffusion processes. The main tool of the study is the coupling by change of measures.     

Derivation of three-derivative Runge-Kutta methods

We introduce an algorithm for a numerical integration of ordinary differential equations in the form of y′ = f(y). We extend the two-derivative Runge-Kutta methods (Chan and Tsai, Numer. Algor. 53, 171–194, 2010) to three-derivative Runge-Kutta methods by including the third derivative \(y^{\prime \prime \prime }=\hat {g}(y)=f^{\prime \prime }(y)(f(y), f(y))+f^{\prime }(y)f^{\prime }(y)f(y)\). We present an approach based on the algebraic theory of Butcher (Math. Comp. 26, 79–106, 1972) and the \(\mathcal {B}-\) series theory of Hairer and Wanner (Computing 13, 1–15 (1974)) combined with the methodology of Chan and Chan (Computing 77(3), 237–252, 2006). In this study, special explicit three-derivative Runge-Kutta methods that possess one evaluation of first derivative, one evaluation of second derivative, and many evaluations of third derivative per step are introduced. Methods with stages up to six and of order up to ten are presented. The numerical calculations have been performed on some standard problems and comparisons made with the accessible methods in the literature.     

Estimates of the $$k{\text {th}}$$ prime under the Riemann hypothesis

We construct an Euler system of generalized Heegner cycles to bound the Selmer group associated to a modular form and an algebraic Hecke character. The main argument is based on Kolyvagin’s method adapted by Bertolini and Darmon (J Reine Angew Math 412:63–74, 1990) and by Neková? (Invent Math 107(1):99–125, 1992), while the key object of the Euler system, the generalized Heegner cycles were first considered by Bertolini et al. (Duke Math J 162(6):1033–1148, 2013).