Tripling Construction for Large Sets of Resolvable Directed Triple Systems

In this paper, we first define a doubly transitive resolvable idempotent quasigroup （DTRIQ）, and show that aDTRIQ of order v exists if and only ifv ≡0（mod3） and v ≠ 2（mod4）. Then we use DTRIQ to present a tripling construction for large sets of resolvable directed triple systems, which improves an earlier version of tripling construction by Kang （J. Combin. Designs, 4 （1996）, 301-321）. As an application, we obtain an LRDTS（4·3^n） for any integer n ≥ 1, which provides an infinite family of even orders.     

Large Sets and Overlarge Sets of Triangle-Decomposition

There are six types of triangles:undirected triangle,cyclic triangle,transitive triangle,mixed-1triangle,mixed-2 triangle and mixed-3 triangle.The triangle-decompositions for the six types of triangles havealready been solved.For the first three types of triangles,their large sets have already been solved,and theiroverlarge sets have been investigated.In this paper,we establish the spectrum of LT_i(v,λ),OLT_i(v)(i=1,2),and give the existence of LT_3(v,λ)and OLT_3(v,λ)with λ even.     

Semiregular Large Sets

We develop the notion of t-homogeneous, G-semiregular large sets of t-designs, show that there are infinitely many 3-homogeneous PSL(2, q)-semiregular large sets when q 3 mod 4, two sporadic 3-homogeneous AL(1,32)-semiregular large sets, and no other interesting t-homogeneous G-semiregular large sets for t 3.     

Precomplete Clones on Infinite Sets which are Closed under Conjugation

We show that on an infinite set, there exist no other precomplete clones closed under conjugation except those which contain all permutations. Since on base sets of some infinite cardinalities, in particular on countably infinite ones, the precomplete clones containing the permutations have been determined, this yields a complete list of the precomplete conjugation-closed clones in those cases. In addition, we show that there exist no precomplete submonoids of the full transformation monoid which are closed under conjugation except those which contain the permutations; the monoids of the latter kind are known.     

组合设计的大集

组合设计中的大集问题有着悠久的历史和广泛的应用．由于它的难度，长期进展很慢．近二十多年来，在一些新的方法和手段的推动下，大集研究呈现了很好的态势．本文力图对几类主要组合设计大集的概念和研究进展给予概要介绍，以期引起更多的关注。     

Bohr Sets in Triple Products of Large Sets in Amenable Groups

We answer a question of Hegyvári and Ruzsa concerning effective estimates of the Bohr-regularity of certain triple sums of sets with positive upper Banach densities in the integers. Our proof also works for any discrete amenable group, and it does not require all addends in the triple products we consider to have positive (left) upper Banach densities; one of the addends is allowed to only have positive upper asymptotic density with respect to a (possibly very sparse) ergodic sequence.

     

Planar Digraphs without Large Acyclic Sets

Given a directed graph, an acyclic set is a set of vertices inducing a directed subgraph with no directed cycle. In this note, we show that for all integers , there exist oriented planar graphs of order n and digirth g for which the size of the maximum acyclic set is at most . When this result disproves a conjecture of Harutyunyan and shows that a question of Albertson is best possible.     

Large Sets of Lattices without Order Embeddings

Let I and μ be an infinite index set and a cardinal, respectively, such that |I| ≤ μ and, starting from ?₀, μ can be constructed in countably many steps by passing from a cardinal λ to 2^λ at successor ordinals and forming suprema at limit ordinals. We prove that there exists a system X = {L_i: i ∈ I} of complemented lattices of cardinalities less than |I| such that if i, j ∈ I and φ: L_i → L_j is an order embedding, then i = j and φ is the identity map of L_i. If |I| is countable, then, in addition, X consists of finite lattices of length 10. Stating the main result in other words, we prove that the category of (complemented) lattices with order embeddings has a discrete full subcategory with |I| many objects. Still in other words, the class of these lattices has large antichains (that is, antichains of size |I|) with respect to the quasiorder “embeddability.” As corollaries, we trivially obtain analogous statements for partially ordered sets and semilattices.     

On Large Systems of Sets with No Large Weak Δ-subsystems

weak Δ-system if the cardinality of the intersection of any two sets is the same. We elaborate a construction by R?dl and Thoma [9] and show that for large n, there exists a family ℱ of subsets of without weak Δ-systems of size 3 with . Received: October 1, 1997     

可分解的Hybrid三元系大集和超大集的构造

An LRHTS(v)(or LARHTS(v)) is a collection of {(X, B i) : 1 ≤ i ≤ 4(v-2)},where X is a v-set, each(X, B i) is a resolvable(or almost resolvable) HTS(v), and all B i s form a partition of all cycle triples and transitive triples on X. An OLRHTS(v)(or OLARHTS(v))is a collection {(Y \{y}, A j y) : y ∈ Y, j = 0, 1, 2, 3}, where Y is a(v + 1)-set, each(Y \{y}, A j y)is a resolvable(or almost resolvable) HTS(v), and all A j y s form a partition of all cycle and transitive triples on Y. In this paper, we establish some directed and recursive constructions for LRHTS(v), LARHTS(v), OLRHTS(v), OLARHTS(v) and give some new results.     

Large Cardinals and Ramifiability for Directed Sets

The notion of “ramifiability” (or “tree‐property”), usually applied to cardinals, can be extended to directed sets and is put in relation here with familiar “large cardinal” properties.     

Extracting List Colorings from Large Independent Sets

We take an application of the Kernel Lemma by Kostochka and Yancey [11] to its logical conclusion. The consequence is a sort of magical way to draw conclusions about list coloring (and online list coloring) just from the existence of an independent set incident to many edges. We use this to prove an Ore‐degree version of Brooks' Theorem for online list‐coloring. The Ore‐degree of an edge in a graph G is . The Ore‐degree of G is . We show that every graph with and is online ‐choosable. In addition, we prove an upper bound for online list‐coloring triangle‐free graphs: . Finally, we characterize Gallai trees as the connected graphs G with no independent set incident to at least edges.     

A Construction of Difference Sets

In this paper, we will give a construction of a family of -difference sets in thegroup , where q is any power of 2, K is any group with and G is an abelian 2-group of order which contains anelementary abelian subgroup of index 2.     

Large Sets of Orthogonal Arrays and Multimagic Squares

Large sets of orthogonal arrays (LOA) have been used to construct resilient functions and zigzag functions by D. R. Stinson. In this paper, a special kind of LOA, strong double large sets of orthogonal arrays (SDLOA), is introduced and some constructions are provided. Meanwhile, a construction of multimagic squares based on SDLOAs is also given. As its application, it is proved that a t‐multimagic square of order exists whenever q is a prime power and , , which improves a similar result by H. Derksen et al. from primes to prime powers in Amer. Math. Monthly (2007).     

Extremal Forex Returns in Extremely Large Data Sets

Exciting information for risk and investment analysis is obtained from an exceptionally large and automatically filtered high frequency data set containing all the forex quote prices on Reuters during a ten-year period. It is shown how the high frequency data improve the efficiency of the tail risk cum loss estimates. We demonstrate theoretically and empirically that the heavy tail feature of foreign exchange rate returns implies that position limits for traders calculated under the industry standard normal model are either not prudent enough, or are overly conservative depending on the time horizon.     

Multidimensional Multiplicative Large Sets in Totally Minimal Systems

Acta Mathematica Sinica, English Series - In this paper, it is shown that for a residual set of points in a totally minimal system with finitely many commuting homeomorphisms, the set of return...