具有CO-恰当断面富足半群的一种构造方法

本文首先研究了具有可消模断面的拟恰当半群的结构,然后给出了用可消模断面的拟恰当半群构造具有CO-恰当断面富足半群的方法.     

Independent coverings and orthogonal colourings

In this paper, two open conjectures are disproved. One conjecture regards independent coverings of sparse partite graphs, whereas the other conjecture regards orthogonal colourings of tree graphs. A relation between independent coverings and orthogonal colourings is established. This relation is applied to find independent coverings of some sparse partite graphs. Additionally, a degree condition providing the existence of an independent covering in the case where the graph has a square number of vertices is found.     

Modelling far-field entrainment in compressible flows

A procedure that generates steady-states with accurate far-field entrainment is described here. It can be applied to any existing code originally designed for unsteady simulations. Such steady-states are obtained with physical-time damping, introduced through a dual time stepping methodology to effectively eliminate all transient fluctuations without affecting spatial resolution. Far-field entrainment is guaranteed by using properly selected local boundary conditions. Hence, reference profiles with accurate far-field entrainment are generated from the very same code that will eventually use them in unsteady simulations. This new procedure is tested on an unsteady code designed for compressible planar mixing-layer simulations at arbitrary Mach numbers. It is numerically stable for a wide range of Mach numbers and velocity ratios.     

Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles

We prove that every tournament T with no three disjoint cycles contains a set X of at most four vertices such that is acyclic.     

On the metric dimension of incidence graphs

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension$\mu \left(\Gamma \right)$ is the smallest size of a resolving set for $\Gamma$. We consider the metric dimension of two families of incidence graphs: incidence graphs of symmetric designs, and incidence graphs of symmetric transversal designs (i.e. symmetric nets). These graphs are the bipartite distance-regular graphs of diameter 3, and the bipartite, antipodal distance-regular graphs of diameter 4, respectively. In each case, we use the probabilistic method in the manner used by Babai to obtain bounds on the metric dimension of strongly regular graphs, and are able to show that $\mu \left(\Gamma \right)=O(\sqrt{n}logn)$ (where $n$ is the number of vertices).     

C‐perfect hypergraphs

Let ${\mathcal{H}}=({{X}},{\mathcal{E}})Let ${\mathcal{H}}=({{X}},{\mathcal{E}})$ be a hypergraph with vertex set X and edge set ${\mathcal{E}}$. A C‐coloring of ${\mathcal{H}}$ is a mapping ?:X→? such that |?(E)|<|E| holds for all edges ${{E}}\in{\mathcal{E}}$ (i.e. no edge is multicolored). We denote by $\bar{\chi}({\mathcal{H}})$ the maximum number |?(X)| of colors in a C‐coloring. Let further $\alpha({\mathcal{H}})$ denote the largest cardinality of a vertex set S?X that contains no ${{E}}\in{\mathcal{E}}$, and $\tau({\mathcal{H}})=|{{X}}|-\alpha({\mathcal{H}})$ the minimum cardinality of a vertex set meeting all $E \in {\mathcal{E}}$. The hypergraph ${\mathcal{H}}$ is called C‐perfect if $\bar{\chi}({\mathcal{H}}\prime)=\alpha({\mathcal{H}}\prime)$ holds for every induced subhypergraph ${\mathcal{H}}\prime\subseteq{\mathcal{H}}$. If ${\mathcal{H}}$ is not C‐perfect but all of its proper induced subhypergraphs are, then we say that it is minimally C‐imperfect. We prove that for all r, k∈? there exists a finite upper bound h(r, k) on the number of minimally C‐imperfect hypergraphs ${\mathcal{H}}$ with $\tau({\mathcal{H}})\le {{k}}$ and without edges of more than r vertices. We give a characterization of minimally C‐imperfect hypergraphs that have τ=2, which also characterizes implicitly the C‐perfect ones with τ=2. From this result we derive an infinite family of new constructions that are minimally C‐imperfect. A characterization of minimally C‐imperfect circular hypergraphs is presented, too. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 132–149, 2010     

Transversals in Latin Arrays with Many Distinct Symbols

An array is row‐Latin if no symbol is repeated within any row. An array is Latin if it and its transpose are both row‐Latin. A transversal in an array is a selection of n different symbols from different rows and different columns. We prove that every Latin array containing at least distinct symbols has a transversal. Also, every row‐Latin array containing at least distinct symbols has a transversal. Finally, we show by computation that every Latin array of order 7 has a transversal, and we describe all smaller Latin arrays that have no transversal.     

Frobenius Partitions in Extraspecial Groups

Let K be a field and G be the group of the upper unitriangular (n + 2) × ( n + 2) K-matrices with nonzero entries only in the first row and in the last column. Then G has a normal subgroup N with a complement H which are K-vector spaces respectively of dimensions n + 1 and n. In the present paper we show that the orbit of H under a group of automorphisms of G together with N, forms a partition of G, provided that there exists a commutative (possibly nonassociative) division algebra of dimension n + 1 over K. This algebra exists when K is a finite field.     

Some New Transversality Properties

The theorems of Ceva and Menelaus are concerned with cyclic products of ratios of lengths of collinear segments of triangles or more general polygons. These segments have one endpoint at a vertex of the polygon and one at the intersection point of a side with a suitable line. To these classical results we have recently added a selftransversality theorem in which the suitable line is determined by two other vertices. Here we present additional transversality properties in which the suitable line is determined either by a vertex and the intersection point of two diagonals, or by the intersection points of two pairs of such diagonals. Unexpectedly it turns out that besides several infinite families of systematic cases there are also a few sporadic cases.     

关于HSOLSSOM（2^nu^1）的谱

本文讨论型为２＾ｎｕ＾１的有对称正交侣的带洞自正交拉丁方（ＨＳＯＬＳＳＯＭ（２＾ｎｕ＾１））的谱。证明当ｎ≤９时,ＨＳＯＬＳＳＯＭ（２＾ｎｕ＾１）存在的充分必要条件是ｕ为偶数且ｎ≥３ｕ／２＋１;当ｎ≥２６３时,若ｕ为偶数且ｎ≥２（ｕ－２）,则ＨＳＯＬＳＳＯＭ（２＾ｎｕ＾１）存在。