Open covers and the square bracket partition relation

An open cover of an infinite separable metric space is an -cover of if and for every finite subset of there is a such that . Let be the collection of -covers of . We show that the partition relation holds if, and only if, the partition relation holds.

     

Bohr topologies and partition theorems for vector spaces

We prove a Ramsey-style theorem for sequences of vectors in an infinite-dimensional vector space over a finite field. As an application of this theorem, we prove that there are countably infinite Abelian groups whose Bohr topologies are not homeomorphic.     

Lusin sets

We show that a set of real numbers is a Lusin set if, and only if, it has a covering property similar to the familiar property of Rothberger

     

Selection Principles and Sierpinski Sets

We show that a set of real numbers is a Sierpinski set if, and only if, it satisfies a selection property similar to the familiar Menger property.     

A note on Buczolich's solution of the Weil gradient problem: a construction based on an infinite game

Summary Using an infinite game approach we reprove Buczolich's result that there exists a differentiable function f such that ∇f(0) = 0 and |∇ f |≧1 a.e.     

The minimal excludant and Schmidt's partition theorem

In this work, we study Schmidt's partition theorem in a combinatorial manner, and find a strong refinement which connects the minimal excludant of ordinary partitions to the length of Schmidt's partitions. As a byproduct, we obtain a bivariate form of an identity recorded in Ramanujan's lost notebook.     

Selective ultrafilters and

Mathias (Happy families, Ann. Math. Logic. 12 (1977), 59-111) proved that, assuming the existence of a Mahlo cardinal, it is consistent that CH holds and every set of reals in is -Ramsey with respect to every selective ultrafilter . In this paper, we show that the large cardinal assumption cannot be weakened.

     

STRUCTURES OF VALUES FOR SET GAMES RESTRICTED BY PARTITION SYSTEM

§1IntroductionA cooperative game with transferable utility(TU)is a pair(N,v),where N is anonempty,finite set and v∶2N→R is a characteristic function defined on the power set ofN satisfying v()∶=0.LetCGdenote the set of all cooperative TU-games with anarbitrary player set.An element of N(notation:i∈N)and a nonempty subset S of N(notation:S N or S∈2Nwith S≠)are called a player and coalition respectively,andthe associated real number v(S)is called the worth of coalition S to be in…     

Isotone relations revisited

We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem.     

A Note on Maxflow-Mincut and Homomorphic Equivalence in Matroids

Graph homomorphisms are used to study good characterizations for coloring problems Trans. Amer. Math. Soc. 384 (1996), 1281–1297; Discrete Math. 22 (1978), 287–300). Particularly, the following concept arises in this context: A pair of graphs (A, B) is called a homomorphism duality if for any graph G either there exists a homomorphism : A G or there exists a homomorphism : G B but not both. In this paper we show that maxflow-mincut duality for matroids can be put into this framework using strong maps as homomorphisms. More precisely, we show that, if C _k denotes the circuit of length k + 1, the pairs (C _k , C _{k + 1}) are the only homomorphism dualities in the class of duals of matroids with the strong integer maxflow-mincut property (Jour. Comb. Theor. Ser.B 23 (1977), 189–222). Furthermore, we prove that for general matroids there is only a trivial homomorphism duality.     

Generating functions for vector partition functions and a basic recurrence relation

ABSTRACT

We define a generalized vector partition function and derive an identity for the generating series of such functions associated with solutions to basic recurrence relations of combinatorial analysis. As a consequence we obtain the generating function of the number of generalized lattice paths and a new version of the Chaundy-Bullard identity for the vector partition function.     

Distribution of a certain partition function modulo powers of primes

In this paper, we study a certain partition function a(n) defined by Σ _n≥0 a(n)q ⁿ := Π _n=1(1 − q ⁿ )⁻¹(1 − q ²ⁿ )⁻¹. We prove that given a positive integer j ≥ 1 and a prime m ≥ 5, there are infinitely many congruences of the type a(An + B) ≡ 0 (mod m ^j ). This work is inspired by Ono’s ground breaking result in the study of the distribution of the partition function p(n).     

New weighted Rogers-Ramanujan partition theorems and their implications

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of Göllnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at least two. Consequences of this include Jacobi's celebrated triple product identity for theta functions, Sylvester's famous refinement of Euler's theorem, as well as certain weighted partition identities. Next, by studying partitions with prescribed bounds on successive ranks and replacing these with weighted Rogers-Ramanujan partitions, we obtain two new sets of theorems - a set of three theorems involving partitions into parts (mod 6), and a set of three theorems involving partitions into parts (mod 7), .

     

Euler's partition theorem and the combinatorics of ℓ-sequences

Euler's partition theorem states that the number of partitions of an integer N into odd parts is equal to the number of partitions of N in which the ratio of successive parts is greater than 1. It was shown by Bousquet-Mélou and Eriksson in [M. Bousquet-Mélou, K. Eriksson, Lecture hall partitions II, Ramanujan J. 1 (2) (1997) 165–185] that a similar result holds when “odd parts” is replaced by “parts that are sums of successive terms of an ℓ-sequence” and the ratio “1” is replaced by a root of the characteristic polynomial of the ℓ-sequence. This generalization of Euler's theorem is intrinsically different from the many others that have appeared, as it involves a family of partitions constrained by the ratio of successive parts.In this paper, we provide a surprisingly simple bijection for this result, a question suggested by Richard Stanley. In fact, we give a parametrized family of bijections, that include, as special cases, Sylvester's bijection and a bijection for the lecture hall theorem. We introduce Sylvester diagrams as a way to visualize these bijections and deduce their properties.In proving the bijections, we uncover the intrinsic role played by the combinatorics of ℓ-sequences and use this structure to give a combinatorial characterization of the partitions defined by the ratio constraint. Several open questions suggested by this work are described.     

Defect theorems with compatibility relations

We consider words together with a compatibility relation induced by a relation on letters. Unique factorization with respect to two arbitrary word relations R and S defines the (R,S)-freeness of the semigroup considered. We generalize the stability theorem of Schützenberger and Tilson’s closure result for (R,S)-free semigroups. The inner and the outer (R,S)-unique factorization hull and the (R,S)-free hull of a set of words are introduced and we show how they can be computed. We prove that the (R,S)-unique factorization hulls possess a defect effect, which implies a variant of a cumulative defect theorem of word semigroups. In addition, a defect theorem of partial words is proved as a corollary.     

An alternative theorem for set-valued maps via set relations and its application to robustness of feasible sets

Abstract

This paper contains a generalized Gordan-type alternative theorem for set-valued maps which characterizes set relations without any convexity assumptions using certain evaluation functions. As a direct consequence and as a good example, we discuss robustness (or stability) of linear programming problems for modelling error. Moreover, this theorem can be utilized for that of general vector optimization problems in special cases due to reformation of the evaluation functions.     

MS-代数的理想和同余关系

给出了MS-代数L的理想I=(d]可以成为某个同余关系核的充要条件;分别给出了以L的理想I=(d]为核的最小同余关系及最大同余关系的充要条件．     

A polarized partition relation for cardinals of countable cofinality

We prove that if and , then

for all . This polarized partition relation holds if for every partition either there are and with or there are and with .

     

Feasible partition problem in reverse convex and convex mixed-integer programming

In this paper we consider the consistent partition problem in reverse convex and convex mixed-integer programming. In particular we will show that for the considered classes of convex functions, both integer and relaxed systems can be partitioned into two disjoint subsystems, each of which is consistent and defines an unbounded region. The polynomial time algorithm to generate the partition will be proposed and the algorithm for a maximal partition will also be provided.