Large sets of t-designs through partitionable sets: A survey

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the recursive theorems. We also review the existence results and recursive constructions which have been found by this method.     

Small solutions of nonlinear differential equations near branching points

We construct parametric families of small branching solutions to nonlinear differential equations of the nth order near branching points. We use methods of the analytical theory of branching solutions of nonlinear equations and the theory of differential equations with a regular singular point. We illustrate the general existence theorems with an example of a nonlinear differential equation in a certain magnetic insulation problem.     

Teachers in transition: Moving towards CAS-supported classrooms

In the near future many teachers may be required to incorporate CAS into their teaching practices. Based on classroom observations and interviews over two years, this paper reports how two teachers made the transition from using graphics calculators to CAS calculators while teaching differential calculus to upper secondary school students. Both teachers taught with CAS in ways that were consistent with their beliefs about learning and teaching. Over two years, the teachers' teaching approaches and purpose for use of technology were stable and seemed to be underpinned by their beliefs about learning. In contrast, both teachers made changes to the content they taught (and thus what they used technology for) in response to new institutional knowledge. Content choice seemed to be underpinned by the teachers' purpose for teaching. Other influences impacted on what the teachers taught and how they taught it: the teachers' content knowledge, their pedagogical content knowledge, and the lack of legitimacy of CAS as a tool for learning and during examinations in the trial school and wider educational community. The extent of differences noted between the responses of just two teachers indicates that there will be many responses to using CAS in classrooms, as teachers aim to achieve different learning goals and interpret their responsibilities to students in different ways.     

Optimal Fine‐Scale Structures in Compliance Minimization for a Shear Load

We return to a classic problem of structural optimization whose solution requires microstructure. It is well‐known that perimeter penalization assures the existence of an optimal design. We are interested in the regime where the perimeter penalization is weak; i.e., in the effect of perimeter as a selection mechanism in structural optimization. To explore this topic in a simple yet challenging example, we focus on a two‐dimensional elastic shape optimization problem involving the optimal removal of material from a rectangular region loaded in shear. We consider the minimization of a weighted sum of volume, perimeter, and compliance (i.e., the work done by the load), focusing on the behavior as the weight ɛ of the perimeter term tends to 0. Our main result concerns the scaling of the optimal value with respect to ɛ. Our analysis combines an upper bound and a lower bound. The upper bound is proved by finding a near‐optimal structure, which resembles a rank‐2 laminate except that the approximate interfaces are replaced by branching constructions. The lower bound, which shows that no other microstructure can be much better, uses arguments based on the Hashin‐Shtrikman variational principle. The regime being considered here is particularly difficult to explore numerically due to the intrinsic nonconvexity of structural optimization and the spatial complexity of the optimal structures. While perimeter has been considered as a selection mechanism in other problems involving microstructure, the example considered here is novel because optimality seems to require the use of two well‐separated length scales.© 2016 Wiley Periodicals, Inc.     

Teaching spline approximation techniques using maple

Using Computer Algebra Systems (CAS)-such as MAPLE-in teaching and learning mathematical concepts is a great challenge both from a didactical and a scientific point of view. We have to rewrite our traditional paper based teaching materials for interactive and living electronic worksheets, Only few statements and principles have to be acquired by the learner and the teacher from the CAS and after they can visualise, make animations modify quickly the program data, perform symbolic and numeric calculations step by step and in the whole, and verify deductions on their own. The author prepared Maple worksheets for teaching different types of function approximating techniques, such as interpolation-, least square-, spline and uniform approximation methods for post-graduate mechanical engineering students. In this paper we want to demonstrate how can we keep and improve the famous problem solving principles and rules given by G. Pólya and R. Descartes (Pólya 1962), when we use the capabilities of CAS. The education principles active learning, motivations and the successive phases are getting new meaning in the CAS. Our examples are always concerning with spline functions. Handling the formulas, calculating values and giving proofs are always in the form of Maple statements.     

Constructing quasiminimal structures

Quasiminimal structures play an important role in non‐elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first‐order theory. We present several constructions with increasing control of the properties of the outcome using increasingly stronger assumptions on the theory. We also establish an upper bound on the Hanf number of the existence of arbitrarily large quasiminimal models.     

Constructing knowledge about the trigonometric functions and their geometric meaning on the unit circle

Processes of knowledge construction are investigated. A learner is constructing knowledge about the trigonometric functions and their geometric meaning on the unit circle. The analysis is based on the dynamically nested epistemic action model for abstraction in context. Different tasks are offered to the learner. In his effort to perform the different tasks, he has the opportunity to understand the process used to create unit circle representations of trigonometric expressions. The theoretical framework of abstraction in context is used to analyse the evolution of the learner's construction of knowledge in the transition from ‘triangle’ trigonometry to ‘circle’ trigonometry.     

Application of CAS for teaching of integral-transforming theorems

Teaching vector calculus (the integral-transforming theorems, in particular) to students of engineering has got many difficulties. On the one hand complex and deep knowledge of vector algebra (in three dimensions) and calculus (in one and many variables) is necessary for understanding, on the other hand it is difficult to illustrate the concepts of vector calculus exclusively by means of blackboard and chalk. In this paper we demonstrate how the line integral, the surface integral, the theorems of Gauss and Stokes are taught with the help of a MAPLE computer algebra system (CAS). Application of this pedagogical method supports the hypothesis that using of CAS makes it possible to teach those kinds of concepts and theorems which are often used in engineering practice but couldn’t be presented because of lack of time and appropriate preliminary training.     

Hodge Integrals and Hurwitz Numbers via Virtual Localization

We give another proof of Ekedahl, Lando, Shapiro, and Vainshtein's remarkable formula expressing Hurwitz numbers (counting covers of P¹ with specified simple branch points, and specified branching over one other point) in terms of Hodge integrals. Our proof uses virtual localization on the moduli space of stable maps. We describe how the proof could be simplified by the proper algebro-geometric definition of a 'relative space'. Such a space has recently been defined by J. Li.     

Bayesian policy support for adaptive strategies using computer models for complex physical systems

In this paper, we discuss combining expert knowledge and computer simulators in order to provide decision support for policy makers managing complex physical systems. We allow future states of the complex system to be viewed after initial policy is made, and for those states to influence revision of policy. The potential for future observations and intervention impacts heavily on optimal policy for today and this is handled within our approach. We show how deriving policy dependent system uncertainty using computer models leads to an intractable backwards induction problem for the resulting decision tree. We introduce an algorithm for emulating an upper bound on our expected loss surface for all possible policies and discuss how this might be used in policy support. To illustrate our methodology, we look at choosing an optimal CO₂ abatement strategy, combining an intermediate complexity climate model and an economic utility model with climate data.     

Simplicity of lie module triple systems

We analyze how certain constructions of Lie module triple systems affect the structure theory, particularly simplicity. We are thus able to show that there is no upper bound on the number of summands in a direct sum decomposition of a simple Lie module triple system as a module for its inner derivation algebra.     

Large deviations for a symmetric branching random walk on a multidimensional lattice

An important role in the theory of branching random walks is played by the problem of the spectrum of a bounded symmetric operator, the generator of a random walk on a multidimensional integer lattice, with a one-point potential. We consider operators with potentials of a more general form that take nonzero values on a finite set of points of the integer lattice. The resolvent analysis of such operators has allowed us to study branching random walks with large deviations. We prove limit theorems on the asymptotic behavior of the Green function of transition probabilities. Special attention is paid to the case when the spectrum of the evolution operator of the mean numbers of particles contains a single eigenvalue. The results obtained extend the earlier studies in this field in such directions as the concept of a reaction front and the structure of a population inside a front and near its boundary.     

Weaving hadamard matrices with maximum excess and classes with small excess

Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004.     

Obtainable sizes of topologies on finite sets

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a topology with a prescribed size, we show that this number has a logarithmic upper bound. We deduce that there exists a topology on n points having k open sets, for all k in an interval which is exponentially large in n. The construction algorithms can be modified to produce topologies where the smallest neighborhood of each point has a minimal size, and we give a range of obtainable sizes for such topologies.     

Coarsening of Folds in Hanging Drapes

We consider the elastic energy of a hanging drape—a thin elastic sheet, pulled down by the force of gravity, with fine‐scale folding at the top that achieves approximately uniform confinement. This example of energy‐driven pattern formation in a thin elastic sheet is of particular interest because the length scale of folding varies with height. We focus on how the minimum elastic energy depends on the physical parameters. As the sheet thickness vanishes, the limiting energy is due to the gravitational force and is relatively easy to understand. Our main accomplishment is to identify the “scaling law” of the correction due to positive thickness. We do this by (i) proving an upper bound, by considering the energies of several constructions and taking the best; and (ii) proving an ansatz‐free lower bound, which agrees with the upper bound up to a parameter‐independent prefactor. The coarsening of folds in hanging drapes has also been considered in the recent physics literature, by using a self‐similar construction whose basic cell has been called a “wrinklon.” Our results complement and extend that work by showing that self‐similar coarsening achieves the optimal scaling law in a certain parameter regime, and by showing that other constructions (involving lateral spreading of the sheet) do better in other regions of parameter space. Our analysis uses a geometrically linear Föppl‐von Kármán model for the elastic energy, and is restricted to the case when Poisson's ratio is 0. © 2016 Wiley Periodicals, Inc.     

Sur L'equation Diophantienne (xn-1)/(x-1)=yq, III

In this paper we study the diophantine equation of the title,which was first introduced by Nagell and Ljunggren during thefirst half of the twentieth century. We describe a method whichallows us, on the one hand when n is fixed, to obtain an upperbound for q, and on the other hand when n and q are fixed, toobtain upper bounds for x and y which are far sharper than thosederived from the theory of linear forms in logarithms. We alsoshow how these bounds can be used even when they seem too largefor a straightforward enumeration of the remaining possiblevalues of x. By combining all these techniques, we are ableto solve the equation in many cases, including the case whenn has a prime divisor less than 13, or the case when n has aprime divisor which is less than or equal to 23 and distinctfrom q. 2000 Mathematical Subject Classification: primary 11D41;secondary 11J86, 11Y50.     

Properties of Groups for the Cage and Degree/Diameter Problems

A (k, g)-cage is a k-regular graph of girth g of minimum order. While many of the best known constructions of small k-regular graphs of girth g are known to be Cayley graphs, no general theory of the relation between the girth of a Cayley graph and the structure of the underlying group has been developed. We attempt to fill the gap by focusing on the girths of Caley graphs of nilpotent and solvable groups, and present a series of results supporting the intuitive idea that the closer a group is to being abelian, the less suitable it is for constructing Cayley graphs of large girths. Specifically, we establish the existence of upper bounds on the girths of Cayley graphs with respect to the nilpotency class and/or the length of the derived sequence of the underlying groups.     

Dimensions of random recursive sets

We prove a theorem that generalizes the equality among the packing, Hausdorff, and upper and lower Minkowski dimensions for a general class of random recursive constructions, and apply it to constructions with finite memory. Then we prove an upper bound on the packing dimension of certain random distribution functions on [0, 1]. Bibliography: 7 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 328, 2005, pp. 20–26.