Dual Split Quaternions and Chasles’ Theorem in 3-Dimensional Minkowski Space {\mathbb{E}^{3}_{1}}

In 1831, Michel Chasles proved the existence of a fixed line under a general displacement in ${\mathbb{R}^3}$ . The fixed line called the screw axis of displacement was obtained by McCharthy in [10]. The purpose of this paper is to develop the method which is given for the pure rotation in [14], and thus to obtain the screw axis of spatial displacement in 3-dimensional Minkowski space. Firstly, we give a relation between dual vectors and lines in ${\mathbb{E}^{3}_{1}}$ , characterize the screw axis. Also, we discuss the dual split quaternion representation of a spatial displacement.     

Exponential polynomials on commutative hypergroups

Polynomials and exponential polynomials play a fundamental role in the theory of spectral analysis and spectral synthesis on commutative groups. Recently several new results have been published in this field [2–4,6]. Spectral analysis and spectral synthesis has been studied on some types of commutative hypergroups, as well. However, a satisfactory definition of exponential monomials on general commutative hypergroups has not been available so far. In [5,7,8] and [9], the authors use a special concept on polynomial and Sturm–Liouville-hypergroups. Here we give a general definition which covers the known special cases.     

The Mixed Curvatures on C N

The aim of the present paper is devoted to the investigation of some geometrical properties on the middle envelope in terms of the invariants of the third quadratic form of the normal line congruence C_N . The mixed middle curvature and mixed curvature on C_N are obtained in tenus of the Mean and Gauss curvatures of the surface of reference. Our study is considered as a continuation to Stephanidis ([1], [2], [3], [4], [5]). The technique adapted here is based on the methods of moving frames and their related exteriour forms [6] and [7].     

Further results on factorization of meromorphic solutions of partial differential equations

This paper is a continuation of Hu-Yang [2]. Here we extend Malmquist type theorem ofalgebraic differential equations of Steinmetz [3] and Tu [4] to higher order partial differential equations. The results also generalize Theorems 4.2 and 4.3 in [2].     

Vector partition functions and generalized dahmen and micchelli spaces

This is the first of a series of papers on partition functions and the index theory of transversally elliptic operators. In this paper we only discuss algebraic and combinatorial issues related to partition functions. The applications to index theory are in [4], while in [5] and [6] we shall investigate the cohomological formulas generated by this theory. Here we introduce a space of functions on a lattice which generalizes the space of quasipolynomials satisfying the difference equations associated to cocircuits of a sequence of vectors X, introduced by Dahmen and Micchelli [8]. This space $ \mathcal{F}(X) $ contains the partition function $ {\mathcal{P}_{(X)}} $ . We prove a “localization formula” for any f in $ \mathcal{F}(X) $ , inspired by Paradan's decomposition formula [12]. In particular, this implies a simple proof that the partition function $ {\mathcal{P}_{(X)}} $ is a quasi-polynomial on the Minkowski differences $ \mathfrak{c} - B(X) $ , where c is a big cell and B(X) is the zonotope generated by the vectors in X, a result due essentially to Dahmen and Micchelli.     

A symmetry property for q-weighted Robinson–Schensted and other branching insertion algorithms

In [19], a \(q\) -weighted version of the Robinson–Schensted algorithm was introduced. In this paper, we show that this algorithm has a symmetry property analogous to the well-known symmetry property of the usual Robinson–Schensted algorithm. The proof uses a generalisation of the growth diagram approach introduced by Fomin [5–8]. This approach, which uses ‘growth graphs’, can also be applied to a wider class of insertion algorithms which have a branching structure, including some of the other \(q\) -weighted versions of the Robinson–Schensted algorithm which have recently been introduced by Borodin–Petrov [2].     

Quasi-stationary stefan problem with values on the front depending on its geometry

The problem presented below is a singular-limit problem of the extension of the Cahn-Hilliard model obtained via introducing the asymmetry of the surface tension tensor under one of the truncations (approximations) of the inner energy [2, 5–8, 10, 12, 13].     

Classroom-based interventions in mathematics education: relevance, significance, and applicability

This special issue discusses various pedagogical innovations and myriad of significant findings. This commentary is not a synthesis of these contributions, but a summary of my own reflections on selected aspects of the nine papers comprising the special issue. Four themes subsume these reflections: (1) Gestural Communication (Alibali, Nathan, Church, Wolfgram, Kim and Knuth 2013); (2) Development of Ways of Thinking (Jahnke and Wambach 2013; Lehrer, Kobiela and Weinberg 2013; Mariotti 2013; Roberts and A. Stylianides 2013; Shilling-Traina and G. Stylianides 2013; Tabach, Hershkowitz and Dreyfus 2013); (3) Learning Mathematics through Representation (Saxe, Diakow and Gearhart 2013); and (4) Challenges in Dialogic Teaching (Ruthven and Hofmann 2013).     

A multi-dimensional SRBM: geometric views of its product form stationary distribution

We present a geometric interpretation of a product form stationary distribution for a \(d\) -dimensional semimartingale reflecting Brownian motion (SRBM) that lives in the nonnegative orthant. The \(d\) -dimensional SRBM data can be equivalently specified by \(d+1\) geometric objects: an ellipse and \(d\) rays. Using these geometric objects, we establish necessary and sufficient conditions for characterizing product form stationary distribution. The key idea in the characterization is that we decompose the \(d\) -dimensional problem to \(\frac{1}{2}d(d-1)\) two-dimensional SRBMs, each of which is determined by an ellipse and two rays. This characterization contrasts with the algebraic condition of Harrison and Williams (Ann Probab 15:115–137, 1987b). A \(d\) -station tandem queue example is presented to illustrate how the product form can be obtained using our characterization. Drawing the two-dimensional results in Avram et al. (Queueing Syst 37:259–289, 2001), Dai and Miyazawa (Queueing Syst 74:181–217, 2013), we discuss potential optimal paths for a variational problem associated with the three-station tandem queue.     

To the question on the almost everywhere convergence of the Riesz means of double orthogonal series

Sufficient conditions of the classical type ensuring the almost everywhere (a.e.) convergence of the nonnegative-order Riesz means of double orthogonal series are indicated. Analogies of the onedimensional results of Kolmogoroff [7] and Kaczmarz?CZygmund [5, 12] have been obtained for the Cesaro means and those of Zygmund [13] for the Riesz means. These analogies establish the a.e. equiconvergence of the lacunary subsequences of rectangular partial sums and of the entire sequence of Riesz means, generalize the corresponding results of Moricz [9] for the Cesaro a.e. summability by (C, 1, 1), (C, 1, 0), and (C, 0, 1) methods of double orthogonal series, and were announced earlier without proofs in the author??s work [3].     

Smooth Fano Polytopes with Many Vertices

The \(d\) -dimensional simplicial, terminal, and reflexive polytopes with at least \(3d-2\) vertices are classified. In particular, it turns out that all of them are smooth Fano polytopes. This improves on previous results of Casagrande (Ann Inst Fourier (Grenoble) 56(1):121–130, 2006) and Øbro (Manuscr Math 125(1): 69–79, 2008). Smooth Fano polytopes play a role in algebraic geometry and mathematical physics.     

Burgers type equations, Gelfand’s problem and Schumpeterian dynamics

Burgers?? equations have been introduced to study different models of fluids (Bateman, 1915, Burgers, 1939, Hopf, 1950, Cole, 1951, Lighthill andWhitham, 1955, etc.). The difference-differential analogues of these equations have been proposed for Schumpeterian models of economic development (Iwai, 1984, Polterovich and Henkin, 1988, Belenky, 1990, Henkin and Polterovich, 1999, Tashlitskaya and Shananin, 2000, etc.). This paper gives a short survey of the results and conjectures on Burgers type equations, motivated both by fluid mechanics and by Schumpeterian dynamics. Proofs of some new results are given. This paper is an extension and an improvement of (Henkin, 2007, 2011).     

Isomorphisms of groups related to flocks

A truly fruitful way to construct finite generalized quadrangles is through the detection of Kantor families in the general 5-dimensional Heisenberg group over some finite field $\mathbb{F}_{q}$ . All these examples are so-called ??flock quadrangles??. Payne (Geom. Dedic. 32:93?C118, 1989) constructed from the Ganley flock quadrangles the new Roman quadrangles, which appeared not to arise from flocks, but still via a Kantor family construction (in some group of the same order as ). The fundamental question then arose as to whether (Payne in Geom. Dedic. 32:93?C118, 1989). Eventually the question was solved in Havas et?al. (Finite geometries, groups, and computation, pp.?95?C102, de Gruyter, Berlin, 2006; Adv. Geom. 26:389?C396, 2006). Payne??s Roman construction appears to be a special case of a far more general one: each flock quadrangle for which the dual is a translation generalized quadrangle gives rise to another generalized quadrangle which is in general not isomorphic, and which also arises from a Kantor family. Denote the class of such flock quadrangles by . In this paper, we resolve the question of Payne for the complete class . In fact we do more??we show that flock quadrangles are characterized by their groups. Several (sometimes surprising) by-products are described in both odd and even characteristic.     

Cyclic parallel CR-submanifolds of maximal CR-dimension in a complex space form

We first classify \((2n-1)\) -dimensional cyclic parallel CR-submanifold \(M\) with CR-dimension \(n-1\) in a non-flat complex space form of constant holomorphic sectional curvature \(4c\) . Then, we prove that \(||\nabla h||^2\ge 4(n-1)c^2\) , where \(h\) is the second fundamental form on \(M\) . We also completely classify \((2n-1)\) -dimensional CR-submanifolds with CR-dimension \(n-1\) in a non-flat complex space form which satisfy the equality case of this inequality. This generalizes an inequality for real hypersurfaces in a non-flat complex space form obtained by Maeda (J Math Soc Jpn 28:529–540; 1976) and Chen et al. (Algebras Groups Geom 1:176–212; 1984) for complex projective and hyperbolic spaces, respectively.     

Mutually-adjoint boundary-value problems with deviation from the characteristic for a multidimensional Gellerstedt equation

In this paper, we study mutually-adjoint boundary-value problems with a deviation from the characteristic for multidimensional Gellerstedt equation. In [3, 4], for the equation of the vibration of a string, the boundary-value problem with a deviation from the characteristic was studied, where the main attention was paid to the study of such problems for hyperbolic equations. For hyperbolic equations on the plane, this problem was studied in [5, 9].     

Minimal algebras and 2-step nilpotent Lie algebras in dimension 7

We use the methods of Bazzoni and Muñoz (Trans Am Math Soc 364:1007–1028, 2012) to give a classification of 7-dimensional minimal algebras, generated in degree 1, over any field ${\mathbf{k}}$ of characteristic ${{\rm char}(\mathbf{k})\neq 2}$ , whose characteristic filtration has length 2. Equivalently, we classify 2-step nilpotent Lie algebras in dimension 7. This classification also recovers the real homotopy type of 7-dimensional 2-step nilmanifolds.     

Computing Final Polynomials and Final Syzygies Using Buchberger’s Gröbner Bases Method

Final polynomials and final syzygies provide an explicit representation of polynomial identities promised by Hilbert’s Nullstellensatz. Such representations have been studied independently by Bokowski [2,3,4] and Whiteley [23,24] to derive invariant algebraic proofs for statements in geometry. In the present paper we relate these methods to some recent developments in computational algebraic geometry. As the main new result we give an algorithm based on B. Buchberger’s Gröbner bases method for computing final polynomials and final syzygies over the complex numbers. Degree upper bound for final polynomials are derived from theorems of Lazard and Brownawell, and a topological criterion is proved for the existence of final syzygies. The second part of this paper is expository and discusses applications of our algorithm to real projective geometry, invariant theory and matrix theory.     

An inverse-free Newton-Jarratt-type iterative method for solving equations under the gamma condition

A local as well as a semilocal convergence analysis for Newton–Jarratt–type iterative method for solving equations in a Banach space setting is studied here using information only at a point via a gamma-type condition (Argyros in Approximate Solution of Operator Equations with Applications, [2005]; Wang in Chin. Sci. Bull. 42(7):552–555, [1997]). This method has already been examined by us in (Argyros et al. in J. Comput. Appl. Math. 51:103–106, [1994]; Argyros in Comment. Mat. XXIII:97–108, [1994]), where the order of convergence four was established using however information on the domain of the operator. In this study we also establish the same order of convergence under weaker conditions. Moreover we show that all though we use weaker conditions the results obtained here can be used to solve equations in cases where the results in (Argyros et al. in J. Comput. Appl. Math. 51:103–106, [1994]; Argyros in Comment. Mat. XXIII:97–108, [1994]) cannot apply. Our method is inverse free, and therefore cheaper at the second step in contrast with the corresponding two–step Newton methods. Numerical Examples are also provided.     

Strong NP-hardness of scheduling problems with learning or aging effect

Proofs of strong NP-hardness of single machine and two-machine flowshop scheduling problems with learning or aging effect given in Rudek (Computers & Industrial Engineering 61:20–31, 2011; Annals of Operations Research 196(1):491–516, 2012a; International Journal of Advanced Manufacturing Technology 59:299–309, 2012b; Applied Mathematics and Computations 218:6498–6510, 2012c; Applied Mathematical Modelling 37:1523–1536, 2013) contain a common mistake that make them incomplete. We reveal the mistake and provide necessary corrections for the problems in Rudek (Computers & Industrial Engineering 61:20–31, 2011; Annals of Operations Research 196(1):491–516, 2012a; Applied Mathematical Modelling 37:1523–1536, 2013). NP-hardness of problems in Rudek (International Journal of Advanced Manufacturing Technology 59:299–309, 2012b; Applied Mathematics and Computations 218:6498–6510, 2012c) remains unknown because of another mistake which we are unable to correct.