On r-stacked triangulated manifolds

The notion of r-stackedness for simplicial polytopes was introduced by McMullen and Walkup in 1971 as a generalization of stacked polytopes. In this paper, we define the r-stackedness for triangulated homology manifolds and study its basic properties. In addition, we find a new necessary condition for face vectors of triangulated manifolds when all the vertex links are polytopal.     

146号初等元胞自动机的演化语言的复杂性

Symbolic dynamics of cellular automata is introduced by coarse-graining the temporal evolution orbits. Evolution languages are defined. By using the theory of formal languages and automata, the complexity of evolution languages of the elementary cellular automaton of rule 146 is studied and it is proved that its width 1-evolution language is regular, but for every n ≥ 2 its width n-evolution language is not context-free but context-sensitive. Also, the same results hold for the equivalent （under conjugation） elementary cellular automaton of rule 182.     

Initial value/boundary value problems for fractional diffusion-wave equations and applications to some inverse problems

We consider initial value/boundary value problems for fractional diffusion-wave equation: , where 0<α?2, where L is a symmetric uniformly elliptic operator with t-independent smooth coefficients. First we establish the unique existence of the weak solution and the asymptotic behavior as the time t goes to ∞ and the proofs are based on the eigenfunction expansions. Second for α∈(0,1), we apply the eigenfunction expansions and prove (i) stability in the backward problem in time, (ii) the uniqueness in determining an initial value and (iii) the uniqueness of solution by the decay rate as t→∞, (iv) stability in an inverse source problem of determining t-dependent factor in the source by observation at one point over (0,T).     

Applications of mapping cones over Clements–Lindström rings

We prove that Gotzmann's Persistence Theorem holds over every Clements–Lindström ring. We also construct the infinite minimal free resolution of a square-free Borel ideal over such a ring.     

A novel type secoiridoid glucoside,hydrangenoside a from Hydrangea macrophylla

Hydrangenoside A, isolated along with its three congeners from Hydrangea macrophylla, was proved to have a novel type of structure which is thought to be biosynthesized through an aldol-type condensation of secologanin with a unit formed by the shikimate-malonate route followed by decarboxylation.     

On ideals with the Rees property

A homogeneous ideal I of a polynomial ring S is said to have the Rees property if, for any homogeneous ideal ${J \subset S}$ which contains I, the number of generators of J is smaller than or equal to that of I. A homogeneous ideal ${I \subset S}$ is said to be ${\mathfrak{m}}$ -full if ${\mathfrak{m}I:y=I}$ for some ${y \in \mathfrak{m}}$ , where ${\mathfrak{m}}$ is the graded maximal ideal of ${S}$ . It was proved by one of the authors that ${\mathfrak{m}}$ -full ideals have the Rees property and that the converse holds in a polynomial ring with two variables. In this note, we give examples of ideals which have the Rees property but are not ${\mathfrak{m}}$ -full in a polynomial ring with more than two variables. To prove this result, we also show that every Artinian monomial almost complete intersection in three variables has the Sperner property.     

The multiple server effect: Optimal allocation of servers to stations with different service‐time distributions in tandem queueing networks

Traditionally, studies on tandem queueing networks concentrate on systems with infinite buffers, exponential service times, and/or single servers where solutions are more tractable. Less research can be found on more general, less tractable systems. We examine multipleserver systems with finite buffers and nonexponential service times, studying the effects of coefficient of variation (cv) of the servicetime distribution on the throughput of these systems, where cv differs among stations.Starting with the single station, we examine the effects of cv and the number of servers at the station on the distribution of interdeparture times. This insight helps explain the differences in throughput seen in the single (fast) server vs. multiple (slow) server problem. These results, in turn, shed light on the server allocation problem when cv differs among stations. We present some observations, as well as the intuition behind them.     

Algebraic Shifting of Finite Graphs

In the present article, for bipartite graphs and chordal graphs, their exterior algebraic shifted graph and their symmetric algebraic shifted graph are studied. First, we will determine the symmetric algebraic shifted graph of complete bipartite graphs. It turns out that for a ≥ 3 and b ≥ 3, the exterior algebraic shifted graph of the complete bipartite graph K _a,b of size a, b is different from the symmetric algebraic shifted graph of K _a,b . Second, we will show that the exterior algebraic shifted graph of any chordal graph G coincides with the symmetric algebraic shifted graph of G. In addition, it will be shown that the exterior algebraic shifted graph of any chordal graph G is equal to some combinatorial shifted graph of G.