Learning about multiplication by comparing algorithms: “One times one,but actually they are ten times ten”

Multiplication algorithms in primary school are still frequently introduced with little attention to meaning. We present a case study focusing on a third grade class that engaged in comparing two algorithms and discussing “why they both work”. The objectives of the didactical intervention were to foster students' development of mathematical meanings concerning multiplication algorithms, and their development of an attitude to judge and compare the value and efficiency of different algorithms. Underlying hypotheses were that it is possible to promote the simultaneous unfolding of the semiotic potential of two algorithms, considered as cultural artifacts, with respect to the objectives of the didactical intervention, and to establish a fruitful synergy between the two algorithms. As results, this study sheds light onto the new theoretical construct of “bridging sign”, illuminating students’ meaning-making processes involving more than one artifact; and it provides important insight into the actual unfolding of the hypothesized potential of the algorithms.     

矩形多环芳烃的合成

本文用3,4-二苯基-2,5-二(3,5-二溴苯基)环戊二烯酮(4a)与二苯乙炔(5a)通过Diels-Alder环加成反应得到1,2,4,5-四苯基-3,6-二(3,5-二溴苯基)苯(6a)。化合物6a通过经典的Suzuki偶联反应得到1,2,4,5-四苯基-3,6-二(3,5-二(4-十二烷基噻吩))苯基苯(8a),再利用Fe Cl3作为氧化剂发生Scholl氧化脱氢关环反应,得到目标化合物1a。采用类似合成方法,得到目标化合物1b。化合物的结构均通过1H NMR和MALDI-TOF MS表征,并对其光谱特征、热性能及电学性能进行了初步研究。     

Enumeration of polyominoes inscribed in a rectangle

We develop a number of formulas and generating functions for the enumeration of general polyominoes inscribed in a rectangle of given size according to their area. These formulae are then used for the enumeration of lattice trees inscribed in a rectangle with minimum area plus one.     

An approximation algorithm for dissecting a rectangle into rectangles with specified areas

Given a rectangle R with area α and a set of n positive reals A={a₁,a₂,…,a_n} with ∑_ai∈Aa_i=α, we consider the problem of dissecting R into n rectangles r_i with area so that the set R of resulting rectangles minimizes an objective function such as the sum of the perimeters of the rectangles in R, the maximum perimeter of the rectangles in R, and the maximum aspect ratio of the rectangles in R, where we call the problems with these objective functions PERI-SUM, PERI-MAX and ASPECT-RATIO, respectively. We propose an O(nlogn) time algorithm that finds a dissection R of R that is a 1.25-approximate solution to PERI-SUM, a -approximate solution to PERI-MAX, and has an aspect ratio at most , where ρ(R) denotes the aspect ratio of R.     

On cover-structure graphs

Motivated by a problem in communication complexity, we study cover-structure graphs (cs-graphs), defined as intersection graphs of maximal monochromatic rectangles in a matrix. We show that not every graph is a cs-graph. Especially, squares and odd holes are not cs-graphs.It is natural to look at graphs (beautiful graphs) having the property that each induced subgraph is a cs-graph. They form a new class of Berge graphs. We make progress towards their characterization by showing that every square-free bipartite graph is beautiful, and that beautiful line graphs of square-free bipartite graphs are just Path-or-Even-Cycle-of-Cliques graphs.     

Rectangles as sums of squares

In this paper we examine generalisations of the following problem posed by Laczkovich: Given an n×m rectangle with n and m integers, it can be written as a disjoint union of squares; what is the smallest number of squares that can be used? He also asked the corresponding higher dimensional analogue. For the two dimensional case Kenyon proved a tight logarithmic bound but left open the higher dimensional case. Using completely different methods we prove good upper and lower bounds for this case as well as some other variants.     

一维矩形光子晶体中电磁波的传输特性

利用一维矩形光子晶体中电磁波横向受限的条件,推导出电磁波在其中各个模式满足的关系式,从而研究了电磁波各模式的特性.通过色散法研究了电磁波的传输特性随模式量子数和矩形边长的变化规律,得出了一些不同于一维非受限光子晶体的新特征,即一维矩形光子晶体的禁带由模式量子数确定,禁带频率中心和频率宽度与模式量子数和边长有关.     

Minimum perimeter rectangles that enclose congruent non-overlapping circles

We use computational experiments to find the rectangles of minimum perimeter into which a given number, n, of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings found, the circles form the usual regular square-grid or hexagonal patterns or their hybrids. However, for most values of n in the tested range n≤5000, e.g., for n=7,13,17,21,22,26,31,37,38,41,43,…,4997,4998,4999,5000, we prove that the optimum cannot possibly be achieved by such regular arrangements. Usually, the irregularities in the best packings found for such n are small, localized modifications to regular patterns; those irregularities are usually easy to predict. Yet for some such irregular n, the best packings found show substantial, extended irregularities which we did not anticipate. In the range we explored carefully, the optimal packings were substantially irregular only for n of the form n=k(k+1)+1, k=3,4,5,6,7, i.e. for n=13,21,31,43, and 57. Also, we prove that the height-to-width ratio of rectangles of minimum perimeter containing packings of n congruent circles tends to 1 as n→∞.     

Motion characteristics of Bragg grating solitons in rectangle-apodized fiber Bragg gratings

We introduce both concave and convex rectangular apodizations in the middle of fiber Bragg gratings to achieve slow light. Based on the nonlinear coupled mode equations (NLCMEs), the transmission characteristics of grating solitons in rectangle-apodized gratings are numerically simulated and analyzed. The rectangular apodization can change the grating coupling coefficient to give rise to slow and capture the solitons in gratings. The effects of the soliton energy parameters, the width of rectangular apodization and the variation of the coupling coefficient on the soliton transmission are presented. The results show that, the velocity of solitons can be slowed down, and the capability to capture a soliton depends on the energy of input solitons, coupling coefficient, and the rectangular width. Two kinds of soliton capture methods are proposed and compared with each other.