Extensions of dually bipartite regular polytopes

This paper addresses the problem of finding abstract regular polytopes with preassigned facets and preassigned last entry of the Schläfli symbol. Using C-group permutation representation (CPR) graphs we give a solution to this problem for dually bipartite regular polytopes when the last entry of the Schläfli symbol is even. This construction is related to a previous construction by Schulte that solves the problem when the entry of the Schläfli symbol is 6.     

Quasi-sure Flows Associated with Vector Fields of Low Regularity

The authors construct a solution Ut（x） associated with a vector field on the Wiener space for all initial values except in a 1-slim set and obtain the 1-quasi-sure flow property where the vector field is a sum of a skew-adjoint operator not necessarily bounded and a nonlinear part with low regularity, namely one-fold differentiability. Besides, the equivalence of capacities under the transformations of the Wiener space induced by the solutions is obtained.     

Interpolation inequality of logarithmic type in abstract Besov spaces and an application to semilinear evolution equations

An abstract version of Besov spaces is introduced by using the resolvent of nonnegative operators. Interpolation inequalities with respect to abstract Besov spaces and generalized Lorentz spaces are obtained. These inequalities provide a generalization of Sobolev inequalities of logarithmic type. Uniqueness problems to abstract semilinear evolution equations are also discussed (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Conceptual metaphors for isomorphism and homomorphism: Instructors’ descriptions for themselves and when teaching

Group isomorphism and homomorphism are topics central to abstract algebra, yet research on instructors’ views of these concepts is limited. Based on interviews from two instructors as well as classroom video from eight class periods, this paper examines the language used to discuss isomorphism and homomorphism. Language used by instructors in interviews and classroom settings are identified and classified into four main categories: formal definition, mapping, sameness, and combinations of sameness and mapping language. How the two instructors drew on language classified into those four categories in the interview and instruction settings are examined for isomorphism and homomorphism. Similarities and differences between the interview and instruction contexts reveal the wide variety of ways of understanding isomorphism and homomorphism as well as a research need to examine mathematicians’ content knowledge in more than one context.     

Some classes of abstract simplicial complexes motivated by module theory

In this paper we analyze some classes of abstract simplicial complexes relying on algebraic models arising from module theory. To this regard, we consider a left-module on a unitary ring and find models of abstract complexes and related set operators having specific regularity properties, which are strictly interrelated to the algebraic properties of both the module and the ring.Next, taking inspiration from the aforementioned models, we carry out our analysis from modules to arbitrary sets. In such a more general perspective, we start with an abstract simplicial complex and an associated set operator. Endowing such a set operator with the corresponding properties obtained in our module instances, we investigate in detail and prove several properties of three subclasses of abstract complexes.More specifically, we provide uniformity conditions in relation to the cardinality of the maximal members of such classes. By means of the notion of OSS-bijection, we prove a correspondence theorem between a subclass of closure operators and one of the aforementioned families of abstract complexes, which is similar to the classic correspondence theorem between closure operators and Moore systems. Next, we show an extension property of a binary relation induced by set systems when they belong to one of the above families.Finally, we provide a representation result in terms of pairings between sets for one of the three classes of abstract simplicial complexes studied in this work.     

Minkowski-type and Alexandrov-Type Theorems for Polyhedral Herissons

Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image.     

Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers V_λ^⊗N of an irreducible representation V_λ of a compact connected Lie group G. The weights are allowed to depend on N, and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that applies to general asymptotic counting problems for lattice paths with steps in a convex polytope.     

How to make a triangulation of polytopal

We introduce a numerical isomorphism invariant for any triangulation of . Although its definition is purely topological (inspired by the bridge number of knots), reflects the geometric properties of . Specifically, if is polytopal or shellable, then is ``small' in the sense that we obtain a linear upper bound for in the number of tetrahedra of . Conversely, if is ``small', then is ``almost' polytopal, since we show how to transform into a polytopal triangulation by local subdivisions. The minimal number of local subdivisions needed to transform into a polytopal triangulation is at least . Using our previous results [The size of triangulations supporting a given link, Geometry & Topology 5 (2001), 369-398], we obtain a general upper bound for exponential in . We prove here by explicit constructions that there is no general subexponential upper bound for in . Thus, we obtain triangulations that are ``very far' from being polytopal. Our results yield a recognition algorithm for that is conceptually simpler, although somewhat slower, than the famous Rubinstein-Thompson algorithm.