Anderson localization for quasi-periodic CMV matrices and quantum walks

We consider CMV matrices, both standard and extended, with analytic quasi-periodic Verblunsky coefficients and prove Anderson localization in the regime of positive Lyapunov exponents. This establishes the CMV analog of a result Bourgain and Goldstein proved for discrete one-dimensional Schrödinger operators. We also prove a similar result for quantum walks on the integer lattice with suitable analytic quasi-periodic coins.     

The Darmon-Granville Equation with Algebraic Exponents

We will investigate solutions to the Darmon-Granville equation with Gaussian integer exponents.     

Generalized exponents of primitive directed graphs

The exponent of a primitive digraph is the smallest integer t such that for each ordered pair of (not necessarily distinct) vertices x and y there is a path of length t from x to y. There is considerable information known about bounds on exponents and those numbers that can be exponents of primitive digraphs with n vertices. We introduce some new parameters related to the exponent and obtain bounds on these parameters.     

尾数恰含k个零的正Fibonacci数

根据正Fibonacci数Fn的标准分解式中,因子2和因子5的指数的性质,利用初等数论的知识,讨论了尾数恰含k个零的正Fibonacci数Fn的下标n的特征,并证明了:对于任意大的正整数k,都存在着尾数恰含k个零的正Fibonacci数.     

Happy and sad thoughts: An exploration of children's integer reasoning

The purpose of this study was to investigate elementary children's conceptions that might serve as foundations for integer reasoning. Working from an abstract algebraic perspective and using an opposite-magnitudes context that is relevant to children, we analyzed the reasoning of 33 children in grades K-5. We focus our report on three prominent ways of reasoning. We do this by describing and analyzing the responses of three particular children (in Grades 1, 3, and 5) who exemplify these ways of reasoning. We view each of the three ways of reasoning as rich and interesting, and we see relationships of each to formal integer reasoning. At the same time, we view these ways of reasoning in terms of increasing levels of sophistication, potentially belonging to a single learning trajectory. Thus, we see the roots of more sophisticated integer reasoning in children's early intuitions about opposite magnitudes.     

Lyapunov exponent,Liao perturbation and persistence Dedicated to the Memory of Professor Shantao Liao at the Centenary of His Birth

Consider a C~1 vector field together with an ergodic invariant probability that has ? nonzero Lyapunov exponents. Using orthonormal moving frames along a generic orbit we construct a linear system of ?differential equations which is a linearized Liao standard system. We show that Lyapunov exponents of this linear system coincide with all the nonzero exponents of the given vector field with respect to the given ergodic probability. Moreover, we prove that these Lyapunov exponents have a persistence property meaning that a small perturbation to the linear system(Liao perturbation) preserves both the sign and the value of the nonzero Lyapunov exponents.     

An exact approach for the maximum concurrent k-splittable flow problem

We consider the maximization of a multicommodity flow throughput in presence of constraints on the maximum number of paths to be used. Such an optimization problem is strongly NP-hard, and is known in the literature as the maximum routable demand fraction variant of the k-splittable flow problem. Here we propose an exact approach based on branch and bound rules and on an arc-flow mixed integer programming formulation of the problem. Computational results are provided, and a comparison with a standard commercial solver is proposed.     

Integer comparisons across the grades: Students’ justifications and ways of reasoning

This study is an investigation of students’ reasoning about integer comparisons—a topic that is often counterintuitive for students because negative numbers of smaller absolute value are considered greater (e.g., −5 > − 6). We posed integer-comparison tasks to 40 students each in Grades 2, 4, and 7, as well as to 11th graders on a successful mathematics track. We coded for correctness and for students’ justifications, which we categorized in terms of 3 ways of reasoning: magnitude-based, order-based, and developmental/other. The 7th graders used order-based reasoning more often than did the younger students, and it more often led to correct answers; however, the college-track 11th graders, who responded correctly to almost every problem, used a more balanced distribution of order- and magnitude-based reasoning. We present a framework for students’ ways of reasoning about integer comparisons, report performance trends, rank integer-comparison tasks by relative difficulty, and discuss implications for integer instruction.     

Rules-based heuristic approach for the U-shaped assembly line balancing problem

The type-2 U-shaped assembly line balancing problem is important for many just-in-time manufactures, but an efficient algorithm is not available at present. Thus, in this study, a novel heuristic approach based on multiple rules and an integer programming model is proposed to address this problem. In the proposed approach, three rules are systematically grouped together, i.e., task selection, task assignment, and task exchange rules. The sufficient conditions for implementing the exchange rules are proposed and proved. Thirteen small or medium scale benchmark issues comprising 63 instances were solved, where the computational results demonstrate the efficiency and effectiveness of the proposed method compared with integer programming. The computational results obtained for 18 examples comprising 121 instances demonstrate that the task exchange rules significantly improve the computational accuracy compared with the traditional heuristic. Finally, 30 new standard instances produced by a systematic data generation process were also solved effectively by the proposed approach. The proposed heuristic approach with multiple rules can provide a theoretical basis for other local search algorithms, especially for addressing issues such as the U-Shaped assembly line balancing problem.     

Dual Numbers,Weighted Quivers,and Extended Somos and Gale-Robinson Sequences

We investigate a general method that allows one to construct new integer sequences extending existing ones. We apply this method to the classic Somos-4 and Somos-5, and the Gale-Robinson sequences, as well as to more general class of sequences introduced by Fordy and Marsh, and produce a great number of new sequences. The method is based on the notion of “weighted quiver”, a quiver with a \(\mathbb {Z}\)-valued function on the set of vertices that obeys very special rules of mutation.     

Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems

We present a new class of integer extended ABS algorithms for solving linear Diophantine systems. The proposed class contains the integer ABS (the so-called EMAS and our proposed MEMAS) algorithms and the generalized Rosser’s algorithm as its members. After an application of each member of the class a particular solution of the system and an integer basis for the null space of the coefficient matrix are at hand. We show that effective algorithms exist within this class by appropriately setting the parameters of the members of the new class to control the growth of intermediate results. Finally, we propose two effective heuristic rules for selecting certain parameters in the new class of integer extended ABS algorithms.      

Experiments in mixed-integer linear programming using pseudo-costs

This paper discusses heuristic branch and bound methods for solving mixed integer linear programming problems. The research presented on here is the follow on to that recorded in [3].After a resumé of the concept of pseudo-costs and estimations, new heuristic rules for generating a tree which make use of pseudo-costs and estimations are presented. Experiments have shown that models having a low percentage of integer variables behave in a radically different way from models with a high percentage of integer variables. The new heuristic rules seem to apply generally to the first type of model.Later, other heuristic rules are presented that are used with models having a high percentage of integer variables and with models having a special structure (models including special ordered sets.)The rules introduced here have been implemented in the IBM Mathematical Programming System Extended/370. They are used to solve large mixed integer linear programming models.Numerical results that permit comparisons to be made among the different rules are provided and discussed.     

A note on phase synchronization in coupled chaotic fractional order systems

The dynamic behaviors of fractional order systems have received increasing attention in recent years. This paper addresses the reliable phase synchronization problem between two coupled chaotic fractional order systems. An active nonlinear feedback control scheme is constructed to achieve phase synchronization between two coupled chaotic fractional order systems. We investigated the necessary conditions for fractional order Lorenz, Lü and Rössler systems to exhibit chaotic attractor similar to their integer order counterpart. Then, based on the stability results of fractional order systems, sufficient conditions for phase synchronization of the fractional models of Lorenz, Lü and Rössler systems are derived. The synchronization scheme that is simple and global enables synchronization of fractional order chaotic systems to be achieved without the computation of the conditional Lyapunov exponents. Numerical simulations are performed to assess the performance of the presented analysis.     

Lyapunov Exponents for the Random Product of Two Shears

We give lower and upper bounds on both the Lyapunov exponent and generalised Lyapunov exponents for the random product of positive and negative shear matrices. These types of random products arise in applications such as fluid stirring devices. The bounds, obtained by considering invariant cones in tangent space, give excellent accuracy compared to standard and general bounds, and are increasingly accurate with increasing shear. Bounds on generalised exponents are useful for testing numerical methods, since these exponents are difficult to compute in practice.

     

Minimal conic quadratic reformulations and an optimization model

In this paper, we consider a particular form of inequalities which involves product of multiple variables with rational exponents. These inequalities can equivalently be represented by a number of conic quadratic forms called cone constraints. We propose an integer programming model and a heuristic algorithm to obtain the minimum number of cone constraints which equivalently represent the original inequality. The performance of the proposed algorithm and the computational effect of reformulations are numerically illustrated.     

Inequalities for linear combinations of monomials in p-Newton sequences

The partial order on monomials that corresponds to domination when evaluated at positive Newton sequences is fully understood. Here we take up the corresponding partial order on linear combinations of monomials. In part using analysis based upon the cone structure of the exponents in p-Newton sequences, an array of conditions is given for this new partial order. It appears that a characterization in general will be difficult. Within the case in which all coefficients are 1, the situation in which, for general sequence length, there are two monomials, each of length two and nonnegative integer exponents, the partial order is fully characterized. The characterization is combinatorial, in terms of indices in the monomials, and, already here there is much more than term-wise domination.     

Local approximation of functions with several variables

This paper presents the problem of local approximation of scalar functions with several variables, including points of non-differentiability. The procedure considers that the mapping displays rates of change of power type with respect to linear changes in the coordinate domain, and the exponents are not necessarily integer. The approach provides a formula describing the local variability of scalar fields which contains and generalizes Taylor’s formula of first order. The functions giving the contact are Müntz polynomials. The knowledge of their coefficients and exponents enables the finding of local extremes including cases of non-smoothness. Sufficient conditions for the existence of global maxima and minima of concave-convex functions are obtained as well.     

The growth of varieties of Leibniz algebras with nilpotent commutator subalgebra

It is proved that the exponents of certain varieties of Leibniz algebras with nilpotent commutator subalgebras exist and are integer.     

Curvilinear path steplength algorithms for minimization which use directions of negative curvature

The Armijo and Goldstein step-size rules are modified to allow steps along a curvilinear path of the formx() + x + s + ² d, wherex is the current estimate of the minimum,s is a descent direction andd is a nonascent direction of negative curvature. By using directions of negative curvature when they exist, we are able to prove, under fairly mild assumptions, that the sequences of iterates produced by these algorithms converge to stationary points at which the Hessian matrix of the objective function is positive semidefinite.This grant was supported in part by the Army Research Office, Grant No. DAAG 29-77-G-0114.