Some results on embeddings of algebras, after de Bruijn and McKenzie

In 1957, N.G. de Bruijn showed that the symmetric group Sym(Ω) on an infinite set Ω contains a free subgroup on 2^card(Ω) generators, and proved a more general statement, a sample consequence of which is that for any group A of cardinality card(Ω), the group Sym(Ω) contains a coproduct of 2^card(Ω) copies of A, not only in the variety of all groups, but in any variety of groups to which A belongs. His key lemma is here generalized to an arbitrary variety of algebras V, and formulated as a statement about functors Set V. From this one easily obtains analogs of the results stated above with “group” and Sym(Ω) replaced by “monoid” and the monoid Self(Ω) of endomaps of Ω, by “associative K-algebra” and the K-algebra End_K (V) of endomorphisms of a K-vector-space V with basis Ω, and by “lattice” and the lattice Equiv(Ω) of equivalence relations on Ω. It is also shown, extending another result from de Bruijn's 1957 paper, that each of Sym(Ω), Self(Ω) and End_K(V) contains a coproduct of 2^card(Ω) copies of itself.That paper also gave an example of a group of cardinality 2^card(Ω) that was not embeddable in Sym(Ω), and R. McKenzie subsequently established a large class of such examples. Those results are shown here to be instances of a general property of the lattice of solution sets in Sym(Ω) of sets of equations with constants in Sym(Ω). Again, similar results - this time of varying strengths - are obtained for Self(Ω), End_K(V), and Equiv(Ω), and also for the monoid Rel(Ω) of binary relations on Ω.Many open questions and areas for further investigation are noted.     

An evolving framework for describing student engagement in classroom activities

Student engagement in classroom activities is usually described as a function of factors such as human needs, affect, intention, motivation, interests, identity, and others. We take a different approach and develop a framework that models classroom engagement as a function of students’ conceptual competence in the specific content (e.g., the mathematics of motion) of an activity. The framework uses a spatial metaphor—i.e., the classroom activity as a territory through which students move—as a way to both capture common engagement-related dynamics and as a communicative device. In this formulation, then, students’ engaged participation can be understood in terms of the nature of the “regions” and overall “topography” of the activity territory, and how much student movement such a territory affords. We offer the framework not in competition with other instructional design approaches, but rather as an additional tool to aid in the analysis and conduct of engaging classroom activities.     

Tambarization of a Mackey functor and its application to the Witt–Burnside construction

For an arbitrary group G, a (semi-)Mackey functor is a pair of covariant and contravariant functors from the category of G-sets, and is regarded as a G-bivariant analog of a commutative (semi-)group. In this view, a G-bivariant analog of a (semi-)ring should be a (semi-)Tambara functor. A Tambara functor is firstly defined by Tambara, which he called a TNR-functor, when G is finite. As shown by Brun, a Tambara functor plays a natural role in the Witt–Burnside construction.It will be a natural question if there exist sufficiently many examples of Tambara functors, compared to the wide range of Mackey functors. In the first part of this article, we give a general construction of a Tambara functor from any Mackey functor, on an arbitrary group G. In fact, we construct a functor from the category of semi-Mackey functors to the category of Tambara functors. This functor gives a left adjoint to the forgetful functor, and can be regarded as a G-bivariant analog of the monoid-ring functor.In the latter part, when G is finite, we investigate relations with other Mackey-functorial constructions — crossed Burnside ring, Elliott?s ring of G-strings, Jacobson?s F-Burnside ring — all these lead to the study of the Witt–Burnside construction.     

Geometry of 2 × 2 hermitian matrices

LetD be a division ring which possesses an involution a → α . Assume that is a proper subfield ofD and is contained in the center ofD. It is pointed out that ifD is of characteristic not two, D is either a separable quadratic extension of F or a division ring of generalized quaternions over F and that if D is of characteristic two,D is a separable quadratic extension ofF. Thus the trace map Tr:D → F, a → a + a is always surjective, which is formerly posed as an assumption in the fundamental theorem of n×n hermitian matrices overD when n ≥ 3 and now can be deleted. WhenD is a field, the fundamental theorem of 2 × 2 hermitian matrices overD has already been proved. This paper proves the fundamental theorem of 2×2 hermitian matrices over any division ring of generalized quaternions of characteristic not two This research was completed during a visit to the Academy of Mathematics and System Sciences, Chinese Academy of Sciences.     

Filling polygonal holes with minimal energy surfaces on Powell-Sabin type triangulations

In this paper we present two different methods for filling in a hole in an explicit 3D surface, defined by a smooth function f in a part of a polygonal domain D⊂R². We obtain the final reconstructed surface over the whole domain D. We do the filling in two different ways: discontinuous and continuous. In the discontinuous case, we fill the hole with a function in a Powell-Sabin spline space that minimizes a linear combination of the usual seminorms in an adequate Sobolev space, and approximates (in the least squares sense) the values of f and those of its normal derivatives at an adequate set of points. In the continuous case, we will first replace f outside the hole by a smoothing bivariate spline s_f, and then we fill the hole also with a Powell-Sabin spline minimizing a linear combination of given seminorms. In both cases, we obtain existence and uniqueness of solutions and we present some graphical examples, and, in the continuous case, we also give a local convergence result.     

Full Ideals

Contractedness of 𝔪-primary integrally closed ideals played a central role in the development of Zariski's theory of integrally closed ideals in two-dimensional regular local rings (R, 𝔪). In such rings, the contracted 𝔪-primary ideals are known to be characterized by the property that I: 𝔪 = I: x for some x ∈ 𝔪 ?𝔪². We call the ideals with this property full ideals and compare this class of ideals with the classes of 𝔪-full ideals, basically full ideals, and contracted ideals in higher dimensional regular local rings. The 𝔪-full ideals are easily seen to be full. In this article, we find a sufficient condition for a full ideal to be 𝔪-full. We also show the equivalence of the properties full, 𝔪-full, contracted, integrally closed, and normal, for the class of parameter ideals. We then find a sufficient condition for a basically full parameter ideal to be full.     

Some properties of c-covers of a pair of Lie algebras

In [H. Safa and H. Arabyani, On c-nilpotent multiplier and c-covers of a pair of Lie algebras, Commun. Algebra 45(10) (2017), 4429–4434], we characterized the structure of the c-nilpotent multiplier of a pair of Lie algebras in terms of its c-covering pairs and discussed some results on the existence of c-covers of a pair of Lie algebras. In the present paper, it is shown under some conditions that a relative c-central extension of a pair of Lie algebras is a homomorphic image of a c-covering pair. Moreover, we prove that a c-cover of a pair of finite dimensional Lie algebras, under some assumptions, has a unique domain up to isomorphism and also that every perfect pair of Lie algebras admits at least one c-cover. Finally, we discuss a result concerning the isoclinism of c-covering pairs.     

Biharmonic extensions on trees without positive potentials

Let T be a tree rooted at e endowed with a nearest-neighbor transition probability that yields a recurrent random walk. We show that there exists a function K biharmonic off e whose Laplacian has potential theoretic importance and, in addition, has the following property: Any function f on T which is biharmonic outside a finite set has a representation, unique up to addition of a harmonic function, of the form f=βK+B+L, where β a constant, B is a biharmonic function on T, and L is a function, subject to certain normalization conditions, whose Laplacian is constant on all sectors sufficiently far from the root. We obtain a characterization of the functions biharmonic outside a finite set whose Laplacian has 0 flux similar to one that holds for a function biharmonic outside a compact set in Rn for n=2,3, and 4 proved by Bajunaid and Anandam. Moreover, we extend the definition of flux and, under certain restrictions on the tree, we characterize the functions biharmonic outside a finite set that have finite flux in this extended sense.     

New parameters of subsets in polynomial association schemes

We define new parameters, a zero interval and a dual zero interval, of subsets in P- or Q-polynomial association schemes. A zero interval of a subset in a P-polynomial association scheme is a successive interval index for which the inner distribution vanishes, and a dual zero interval of a subset in a Q-polynomial association scheme is a successive interval index for which the dual inner distribution vanishes. We derive bounds of the lengths of a zero interval and a dual zero interval using the degree and dual degree respectively, and show that a subset in a P-polynomial association scheme (resp. a Q-polynomial association scheme) having a large length of a zero interval (resp. a dual zero interval) induces a completely regular code (resp. a Q-polynomial association scheme). Moreover, we consider the spherical analogue of a dual zero interval.     

Heavy and light traffic in fluid models with burst arrivals

We consider the problem of finding a heavy and light traffic limits for the steady-state workload in a fluid model having a continuous burst arrival process. Such a model is useful for describing (among other things) the packetwise transmission of data in telecommunications, where each packet is approximated to be a continuous flow. Whereas in a queueing model, each arrival epoch,t _n , corresponds to a customer with a service timeS _n , the burst model is different: each arrival epoch,t _n , corresponds to a burst of work, that is, a continuous flow of work (fluid, information) to the system at rate 1 during the time interval [t _n ,t _n +S _n ]. In the present paper we show that the burst and queueing models share the same heavy-traffic limit for work, but that their behavior in light traffic is quite different.Research supported by the Japan Society for the Promotion of Science, during the author's fellowship in Tokyo.Research funded by C & C Information Technology Research Laboratories, NEC, and the International Science Foundation.     

Automorphisms of Strongly Regular Krein Graphs without Triangles

A strongly regular graph is called a Krein graph if, in one of the Krein conditions, an equality obtains for it. A strongly regular Krein graph Kre(r) without triangles has parameters ((r² + 3r)², r³ + 3r² + r, 0, r² + r). It is known that Kre(1) is a Klebsh graph, Kre(2) is a Higman-Sims graph, and that a graph of type Kre(3) does not exist. Let G be the automorphism group of a hypothetical graph Γ = Kre(5), g be an element of odd prime order p in G, and Ω = Fix(g). It is proved that either Ω is the empty graph and p = 5, or Ω is a one-vertex graph and p = 41, or Ω is a 2-clique and p = 17, or Ω is the complete bipartite graph K_8,8, from which the maximal matching is removed, and p = 3.Supported by RFBR grant No. 05-01-00046.__________Translated from Algebra i Logika, Vol. 44, No. 3, pp. 335–354, May–June, 2005.     

Two-worker blocking congestion model with walk speed m in a no-passing circular passage system

This paper introduces a blocking model and closed-form expression of two workers traveling with walk speed m (m = integer) in a no-passing circular-passage system of n stations and assuming n = m + 2, 2m + 2, …. We develop a Discrete-Timed Markov Chain (DTMC) model to capture the workers’ changes of walk, pick, and blocked states, and quantify the throughput loss from blocking congestion by deriving a steady state probability in a closed-form expression. We validate the model with a simulation study. Additional simulation comparisons show that the proposed throughput model gives a good approximation of a general-sized system of n stations (i.e., n > 2), a practical walk speed system of real number m (i.e., m ? 1), and a bucket brigade order picking application.     

The Galois Theory of Matrix C-rings

A theory of monoids in the category of bicomodules of a coalgebra C or C-rings is developed. This can be viewed as a dual version of the coring theory. The notion of a matrix ring context consisting of two bicomodules and two maps is introduced and the corresponding example of a C-ring (termed a matrix C -ring) is constructed. It is shown that a matrix ring context can be associated to any bicomodule which is a one-sided quasi-finite injector. Based on this, the notion of a Galois module is introduced and the structure theorem, generalising Schneider’s Theorem II [Schneider, Isr. J. Math., 72:167–195, 1990], is proven. This is then applied to the C-ring associated to a weak entwining structure and a structure theorem for a weak A-Galois coextension is derived. The theory of matrix ring contexts for a firm coalgebra (or infinite matrix ring contexts) is outlined. A Galois connection associated to a matrix C-ring is constructed. Dedicated to Stef Caenepeel on the occasion of his 50th birthday.     

Intertwining wavelets or multiresolution analysis on graphs through random forests

We propose a new method for performing multiscale analysis of functions defined on the vertices of a finite connected weighted graph. Our approach relies on a random spanning forest to downsample the set of vertices, and on approximate solutions of Markov intertwining relation to provide a subgraph structure and a filter bank leading to a wavelet basis of the set of functions. Our construction involves two parameters q and $q^{\prime }$. The first one controls the mean number of kept vertices in the downsampling, while the second one is a tuning parameter between space localization and frequency localization. We provide an explicit reconstruction formula, bounds on the reconstruction operator norm and on the error in the intertwining relation, and a Jackson-like inequality. These bounds lead to recommend a way to choose the parameters q and $q^{\prime }$. We illustrate the method by numerical experiments.     

The Relation of the Morse Index of Closed Geodesics with the Maslov-type Index of Symplectic Paths

In this paper, we consider the relation of the Morse index of a closed geodesic with the Maslov–type index of a path in a symplectic group. More precisely, for a closed geodesic c on a Riemannian manifold M with its linear Poincaré map P (a symplectic matrix), we construct a symplectic path γ(t) starting from identity I and ending at P, such that the Morse index of the closed geodesic c equals the Maslov–type index of γ. As an application of this result, we study the parity of the Morse index of any closed geodesic. Project 10071040 supported by NNSF, 200014 supported by Excellent. Ph.D. Funds of ME of China, and PMC Key Lab. of ME of China     

An approximation algorithm for the generalized assignment problem

The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing jobj on machinei requires timep _ij and incurs a cost ofc _ij ; each machinei is available forT _i time units, and the objective is to minimize the total cost incurred. Our main result is as follows. There is a polynomial-time algorithm that, given a valueC, either proves that no feasible schedule of costC exists, or else finds a schedule of cost at mostC where each machinei is used for at most 2T _i time units.We also extend this result to a variant of the problem where, instead of a fixed processing timep _ij , there is a range of possible processing times for each machine—job pair, and the cost linearly increases as the processing time decreases. We show that these results imply a polynomial-time 2-approximation algorithm to minimize a weighted sum of the cost and the makespan, i.e., the maximum job completion time. We also consider the objective of minimizing the mean job completion time. We show that there is a polynomial-time algorithm that, given valuesM andT, either proves that no schedule of mean job completion timeM and makespanT exists, or else finds a schedule of mean job completion time at mostM and makespan at most 2T. Research partially supported by an NSF PYI award CCR-89-96272 with matching support from UPS, and Sun Microsystems, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.Research supported in part by a Packard Fellowship, a Sloan Fellowship, an NSF PYI award, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.     

Factorizing τ-spectra of mappings

In this paper by a spectrum of mappings we mean a morphism of spectra of spaces. However, using the notion of a mapping of mappings, we give the definition of a spectrum of mappings similar to that of a spectrum of spaces. In this case, the formulations of the given results are also similar to the formulations of the corresponding results concerning the spectra of spaces.For the spectra of mappings we define the notion of a τ-spectrum of mappings factorizing in a special sense and prove a version of the Spectral Theorem for such spectra. Furthermore, to a given indexed collection F of mapping we associate a τ-spectrum factorizing in the above special sense whose mappings are Containing Mappings for F constructed in Iliadis (2005) [4]. These associated τ-spectra and the corresponding version of the Spectral Theorem imply that for a given indexed collection F of mappings any so-called “natural” τ-spectrum for F factorizing in the special sense contains a cofinal and τ-closed subspectrum whose mappings are Containing Mapping for F. Thus, Containing Mappigs for F appear here without any concrete construction. The associated τ-spectra are used also in order to define and characterize the so-called second-type saturated classes of mappings (which are “saturated” by universal elements).     

Normality of products of monotonically normal spaces with compact spaces

Let S be the class of all spaces, each of which is homeomorphic to a stationary subset of a regular uncountable cardinal (depending on the space). In this paper, we prove the following result: The product X×C of a monotonically normal space X and a compact space C is normal if and only if S×C is normal for each closed subspace S in X belonging to S. As a corollary, we obtain the following result: If the product of a monotonically normal space and a compact space is orthocompact, then it is normal.