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.     

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.     

Characterizations of optimal scalings of matrices

A scaling of a non-negative, square matrixA ≠ 0 is a matrix of the formDAD ^?1, whereD is a non-negative, non-singular, diagonal, square matrix. For a non-negative, rectangular matrixB ≠ 0 we define a scaling to be a matrixCBE ^?1 whereC andE are non-negative, non-singular, diagonal, square matrices of the corresponding dimension. (For square matrices the latter definition allows more scalings.) A measure of the goodness of a scalingX is the maximal ratio of non-zero elements ofX. We characterize the minimal value of this measure over the set of all scalings of a given matrix. This is obtained in terms of cyclic products associated with a graph corresponding to the matrix. Our analysis is based on converting the scaling problem into a linear program. We then characterize the extreme points of the polytope which occurs in the linear program.     

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.     

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.     

Fuzzy sets as a basis for a theory of possibility

The theory of possibility described in this paper is related to the theory of fuzzy sets by defining the concept of a possibility distribution as a fuzzy restriction which acts as an elastic constraint on the values that may be assigned to a variable. More specifically, if F is a fuzzy subset of a universe of discourse U={u} which is characterized by its membership function μ_F, then a proposition of the form “X is F,” where X is a variable taking values in U, induces a possibility distribution ∏X which equates the possibility of X taking the value u to μF(u)—the compatibility of u with F. In this way, X becomes a fuzzy variable which is associated with the possibility distribution ∏_x in much the same way as a random variable is associated with a probability distribution. In general, a variable may be associated both with a possibility distribution and a probability distribution, with the weak connection between the two expressed as the possibility/probability consistency principle.A thesis advanced in this paper is that the imprecision that is intrinsic in natural languages is, in the main, possibilistic rather than probabilistic in nature. Thus, by employing the concept of a possibility distribution, a proposition, p, in a natural language may be translated into a procedure which computes the probability distribution of a set of attributes which are implied by p. Several types of conditional translation rules are discussed and, in particular, a translation rule for propositions of the form “X is F is α-possible,” where α is a number in the interval [0, 1], is formulated and illustrated by examples.     

Topological vector spaces, compacta, and unions of subspaces

In the first two sections, we study when a σ-compact space can be covered by a point-finite family of compacta. The main result in this direction concerns topological vector spaces. Theorem 2.4 implies that if such a space L admits a countable point-finite cover by compacta, then L has a countable network. It follows that if f is a continuous mapping of a σ-compact locally compact space X onto a topological vector space L, and fibers of f are compact, then L is a σ-compact space with a countable network (Theorem 2.10). Therefore, certain σ-compact topological vector spaces do not have a stronger σ-compact locally compact topology.In the last, third section, we establish a result going in the orthogonal direction: if a compact Hausdorff space X is the union of two subspaces which are homeomorphic to topological vector spaces, then X is metrizable (Corollary 3.2).     

On Simple Polygonalizations with Optimal Area

We discuss the problem of finding a simple polygonalization for a given set of vertices P that has optimal area. We show that these problems are very closely related to problems of optimizing the number of points from a set Q in a simple polygon with vertex set P and prove that it is NP-complete to find a minimum weight polygon or a maximum weight polygon for a given vertex set, resulting in a proof of NP-completeness for the corresponding area optimization problems. This answers a generalization of a question stated by Suri in 1989. Finally, we turn to higher dimensions, where we prove that, for 1 k d , 2 d , it is NP-hard to determine the smallest possible total volume of the k -dimensional faces of a d -dimensional simple nondegenerate polyhedron with a given vertex set, answering a generalization of a question stated by O'Rourke in 1980. Received June 26, 1997, and in revised form February 13, 1999, and May 19, 1999.     

EP morphisms

The concept of an EP matrix is extended to a morphism of a category C with involution. It is shown that an EP morphism has a group inverse iff it has a Moore-Penrose inverse, and in this case the inverses are identical. On the other hand, if a morphism has a Moore-Penrose inverse that is a group inverse, then C is a full subcategory of a category in which φ is EP. Also, if C is an additive category with involution 1 and with 1-biproduct factorization, then a morphism of φ of C is EP iff there is a 1-biproduct J ⊕ K and an invertible morphism θ : J → J such that φ is congruent to a morphism of the form

$\text{θ 0}\text{0 0}\text{: J⊕K → J⊕K.}$

In particular, a square matrix over a principal-ideal domain with involution is EP iff it is congruent to a matrix of the form dg(θ, 0) with θ invertible.     

Partially ordered knapsack and applications to scheduling

In the partially ordered knapsack problem (POK) we are given a set N of items and a partial order ?_P on N. Each item has a size and an associated weight. The objective is to pack a set N^′⊆N of maximum weight in a knapsack of bounded size. N^′ should be precedence-closed, i.e., be a valid prefix of ?_P. POK is a natural generalization, for which very little is known, of the classical Knapsack problem. In this paper we present both positive and negative results. We give an FPTAS for the important case of a two-dimensional partial order, a class of partial orders which is a substantial generalization of the series-parallel class, and we identify the first non-trivial special case for which a polynomial-time algorithm exists. Our results have implications for approximation algorithms for scheduling precedence-constrained jobs on a single machine to minimize the sum of weighted completion times, a problem closely related to POK.     

Braided surfaces and seifert ribbons for closed braids

Apositive band in the braid groupB _n is a conjugate of one of the standard generators; a negative band is the inverse of a positive band. Using the geometry of the configuration space, a theory of bands andbraided surfaces is developed. Each representation of a braid as a product of bands yields a handle decomposition of aSeifert ribbon bounded by the corresponding closed braid; and up to isotopy all Seifert ribbons occur in this manner. Thus,band representations provide a convenient calculus for the study of ribbon surfaces. For instance, from a band representation, a Wirtinger presentation of the fundamental group of the complement of the associated Seifert ribbon inD ⁴ can be immediately read off, and we recover a result of T. Yajima (and D. Johnson) that every Wirtinger-presentable group appears as such a fundamental group. In fact, we show that every such group is the fundamental group of a Stein manifold, and so that there are finite homotopy types among the Stein manifolds which cannot (by work of Morgan) be realized as smooth affine algebraic varieties.     

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.     

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.     

Regular orbits in powers of permutation representations

Let (Q,G) be a faithful permutation representation of a finite group G. Suppose that the G-set Q has t distinct non-zero marks. In a permutation representation analogue of a theorem of Brauer on linear representations, it is shown that the direct power (Q,G)^t of (Q,G) contains a regular orbit. As a corollary, the probability that a random element of Q^r lies in a regular orbit of (Q,G)^r is shown to tend to 1 exponentially fast as r tends to \infin\infin. Further, knowledge of the rate of convergence is equivalent to knowledge of the second largest value of the character of the linear permutation representation.     

Structure of <Emphasis Type="Italic">K</Emphasis>-interval exchange transformations: Induction,trajectories, and distance theorems

We define a new induction algorithm for k-interval exchange transformations associated to the “symmetric” permutation i ↦ k − i + 1. Acting as a multi-dimensional continued fraction algorithm, it defines a sequence of generalized partial quotients given by an infinite path in a graph whose vertices, or states, are certain trees we call trees of relations. This induction is self-dual for the duality between the usual Rauzy induction and the da Rocha induction. We use it to describe those words obtained by coding orbits of points under a symmetric interval exchange, in terms of the generalized partial quotients associated with the vector of lengths of the k intervals. As a consequence, we improve a bound of Boshernitzan in a generalization of the three-distances theorem for rotations. However, a variant of our algorithm, applied to a class of interval exchange transformations with a different permutation, shows that the former bound is optimal outside the hyperelliptic class of permutations.     

Ring structures on groups of arithmetic functions

Using the theory of Witt vectors, we define ring structures on several well-known groups of arithmetic functions, which in another guise are formal Dirichlet series. The set of multiplicative arithmetic functions over a commutative ring R is shown to have a unique functorial ring structure for which the operation of addition is Dirichlet convolution and the operation of multiplication restricted to the completely multiplicative functions coincides with point-wise multiplication. The group of additive arithmetic functions over R also has a functorial ring structure. In analogy with the ghost homomorphism of Witt vectors, there is a functorial ring homomorphism from the ring of multiplicative functions to the ring of additive functions that is an isomorphism if R is a Q-algebra. The group of rational arithmetic functions, that is, the group generated by the completely multiplicative functions, forms a subring of the ring of multiplicative functions. The latter ring has the structure of a Bin(R)-algebra, where Bin(R) is the universal binomial ring equipped with a ring homomorphism to R. We use this algebra structure to study the order of a rational arithmetic function, as well the powersfα for α∈Bin(R) of a multiplicative arithmetic function f. For example, we prove new results about the powers of a given multiplicative arithmetic function that are rational. Finally, we apply our theory to the study of the zeta function of a scheme of finite type over Z.     

Buckling of an axisymmetric vesicle under compression: the effects of resistance to shear

We consider the axisymmetric deformation of an initially spherical,porous vesicle with incompressible membrane having finite resistanceto in-plane shearing, as the vesicle is compressed between parallelplates. We adopt a thin-shell balance-of-forces formulationin which the mechanical properties of the membrane are describedby a single dimensionless parameter, C, which is the ratio ofthe membrane's resistance to shearing to its resistance to bending.This results in a novel free-boundary problem which we solvenumerically to obtain vesicle shapes as a function of plateseparation, h. For small deformations, the vesicle contactseach plate over a small circular area. At a critical value ofplate separation, h_TC, there is a transcritical bifurcationfrom which a new branch of solutions emerges, representing buckledvesicles which contact each plate along a circular curve. Forthe values of C investigated, we find that the transcriticalbifurcation is subcritical and that there is a further saddle-nodebifurcation (fold) along the branch of buckled solutions ath = h_SN (where h_SN > h_TC). The resulting bifurcation structureis commensurate with a hysteresis loop in which a sudden transitionfrom an unbuckled solution to a buckled one occurs as h is decreasedthrough h_TC and a further sudden transition, this time froma buckled solution to an unbuckled one, occurs as h is increasedthrough h_SN. We find that h_SN and h_TC increase with C, thatis, vesicles that resist shear are more prone to buckling.     

Symetries isometriques applications a la dualite des espaces reticules

We show that ifE is a non-reflexive Banach lattice, there exists for everyn a dual of finite even order ofE which contins isometicallyl _n ^/l . We show that itE is a Banach lattice which is isometric to the dual of a Banach spaceX, then the order intervals are σ (E, X)-compact. We prove then that under various conditions, a Banach lattice which is a dual as a Banach space, is a dual as a Banach lattice. In particular, this is true when the predual ofE is unique.      

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.     

Special Weingarten surfaces foliated by circles

In this paper we study surfaces in Euclidean 3-space foliated by pieces of circles that satisfy a Weingarten condition of type aH + bK = c, where a,b and c are constant, and H and K denote the mean curvature and the Gauss curvature respectively. We prove that such a surface must be a surface of revolution, one of the Riemann minimal examples, or a generalized cone. Authors’ address: Departamento de Geometría y Topología, Universidad de Granada, 18071 Granada, Spain