A note on the paper ‘Ultra discrete permanent and the consistency of max plus linear equations’

This work is concerned with the consistency conditions for the equations in max plus algebra. The three classes of the max plus linear equations presented in the paper Shinzawa [Ultra discrete permanent and the consistency of max plus linear equations, Linear Algebra Appl. 506 (2016) 445–477] can be equivalently converted into the corresponding system of inequalities. The equivalence relation between ultra discrete permanent and maximum cycle mean is suggested. Thus, the necessary and sufficient conditions for solvability of the equations are obtained using the maximum cycle mean in this note.     

The Additive Cousin Problem and Related Problems for Regular Functions with Parameter Taking Values in a Clifford Algebra

This article deals with the Runge type approximations problem, the solution of inhomogeneous system and the additive Cousin problem for Clifford-algebra-valued functions ?(x, y) which are regular with respect to x and real-analytic in y. Some main results concerning these three fundamental problems from complex analysis are proved for the class of functions mentioned above.     

G.P.汤姆孙对电子衍射的实验研究

介绍了G．P．汤姆孙完成电子衍射实验,证明了德布罗意提出的物质波理论的研究经历从中可以看到注意研究选题的先进性,注重理论的先导作用和科学的研究方法的重要性。     

Fuzzy蕴涵代数的MP理想与正规MP理想

在Fuzzy蕴涵代数(简称FI代数)上引入了MP理想与正规MP理想的概念并给出了它们的等价刻画;探讨了FI代数的MP理想、偏序理想和正规MP理想间的多种关系, 证明了一个正则FI代数是可交换FI代数当且仅当它的每个MP理想都是正规理想,也当且仅当{0}是正规MP理想.     

基于格值逻辑的模糊概念格

从逻辑的角度,将非经典逻辑之一的格值逻辑引入概念格,建立了格值模糊形式背景,通过格结构来刻画对象与属性之间的模糊关系,证明了由蕴涵算子诱导的算子对是伽罗瓦连接,并讨论了相关的一些性质,进而给出了格值模糊概念格的构造算法.格值模糊概念格的建立为模糊性与不可比较性信息的处理提供了可靠的数学工具.     

关于有1模格的等价定义

进一步讨论有1模格的等价定义问题,得到并证明了一个(2,2,0)型代数成为有1模格的一个充分必要条件.这样大大简化了有1模格的等价定义.     

Decomposition of integer-valued polynomial algebras

Let D be a commutative domain with field of fractions K, let A be a torsion-free D-algebra, and let B be the extension of A to a K-algebra. The set of integer-valued polynomials on A is $\mathrm{Int}(A)=\{f\in B[X]|f(A)?A\}$, and the intersection of $\mathrm{Int}(A)$ with $K[X]$ is ${\mathrm{Int}}_K(A)$, which is a commutative subring of $K[X]$. The set $\mathrm{Int}(A)$ may or may not be a ring, but it always has the structure of a left ${\mathrm{Int}}_K(A)$-module.A D-algebra A which is free as a D-module and of finite rank is called ${\mathrm{Int}}_K$-decomposable if a D-module basis for A is also an ${\mathrm{Int}}_K(A)$-module basis for $\mathrm{Int}(A)$; in other words, if $\mathrm{Int}(A)$ can be generated by ${\mathrm{Int}}_K(A)$ and A. A classification of such algebras has been given when D is a Dedekind domain with finite residue rings. In the present article, we modify the definition of ${\mathrm{Int}}_K$-decomposable so that it can be applied to D-algebras that are not necessarily free by defining A to be ${\mathrm{Int}}_K$-decomposable when $\mathrm{Int}(A)$ is isomorphic to ${\mathrm{Int}}_K(A){?}_{D}A$. We then provide multiple characterizations of such algebras in the case where D is a discrete valuation ring or a Dedekind domain with finite residue rings. In particular, if D is the ring of integers of a number field K, we show that an ${\mathrm{Int}}_K$-decomposable algebra A must be a maximal D-order in a separable K-algebra B, whose simple components have as center the same finite unramified Galois extension F of K and are unramified at each finite place of F. Finally, when both D and A are rings of integers in number fields, we prove that ${\mathrm{Int}}_K$-decomposable algebras correspond to unramified Galois extensions of K.     

Approximating max-cut under graph-MSO constraints

We consider the max-cut and max-$k$-cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of constant treewidth. We give a $\frac{1}{2}$-approximation algorithm for this class of problems.     

Capturing and characterizing students’ strategic algebraic reasoning through cognitively demanding tasks with focus on representations

In mathematics education, it is important to assess valued practices such as problem solving and communication. Yet, often we assess students based on correct solutions over their problem solving strategies—strategies that can uncover important mathematical understanding. In this article, we first present a framework of competencies required for strategic reasoning to solve cognitively demanding algebra tasks and assessment tools to capture evidence of these competencies. Then, we qualitatively describe characteristics of student reasoning for various performance levels (low, medium, and high) of eighth-grade students, focusing on generating and interpreting algebraic representations. We argue this analysis allows a more comprehensive and complex perspective of student understanding. Our findings lay groundwork to investigate the continuum of algebraic understanding, and may help educators identify specific areas of students’ strength and weakness when solving cognitively demanding tasks.     

MAX+PLUSⅡ在EDA中的应用

介绍了MAX+PLUSⅡ软件在EDA中的应用,以正交解码/计数器的设计为例,说明了对Altera公司的FPGA进行图形设计、编译以及在系统编程(ISP)的方法和步骤。