Threshold arrangements and the knapsack problem

We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by V.E. Brimkov and S.S. Dantchev [An alternative to Ben-Or’s lower bound for the knapsack problem complexity, Applied Mathematics Letters 15 (2) (2002) 187–191] is related to threshold graphs, threshold arrangements, and other well-studied combinatorial objects, and we correct an error in the analysis given in that paper.     

On subspace arrangements of type

Let denote the subspace arrangement formed by all linear subspaces in given by equations of the form

₁x_i1=₂x_i2==_kx_ik,

where 1i₁<<i_kn and (₁,…,_k){+1,−1}^k.Some important topological properties of such a subspace arrangement depend on the topology of its intersection lattice. In a previous work on a larger class of subspace arrangements by Björner and Sagan (J. Algebraic Combin. 5 (1996) 291–314) the topology of the intersection lattice turned out to be a particularly interesting and difficult case.We prove in this paper that Pure(Π_n,k^±) is shellable, hence that Π_n,k^± is shellable for k>n/2. Moreover, we prove that unless i≡n−2 (mod k−2) or i≡n−3 (mod k−2), and that is free abelian for i≡n−2 (mod k−2). In the special case of Π_2k,k^± we determine homology completely. Our tools are generalized lexicographic shellability, as introduced in Kozlov (Ann. Combin. 1 (1997) 67–90), and a spectral sequence method for the computation of poset homology first used in Hanlon (Trans. Amer. Math. Soc. 325 (1991) 1–37).We state implications of our results on the cohomology of the complements of the considered arrangements.     

On ordinary points in arrangements

We show that in an arrangement ofn curves in the plane (or on the sphere) there are at leastn/2 points where precisely 2 curves cross (ordinary points). Furthermore there are at least (4/3)n triangular regions in the complex determined by the arrangement. Triangular regions and ordinary vertices are both connected with boundary vertices of certain distinguished subcomplexes. By analogy with rectilinear planar polygons we distinguish concave and convex vertices of these subcomplexes. Our lower bounds arise from lower bounds for convex vertices in the distinguished subcomplexes.     

On the geometry of toric arrangements

Motivated by the counting formulas of integral polytopes, as in Brion and Vergne, and Szenes and Vergne, we start to form the foundations of a theory for toric arrangements, which may be considered as the periodic version of the theory of hyperplane arrangements.     

On representing contexts in line arrangements

Acontext is defined to be a triple (G, M, J) of setsG, M and an incidence relationJ G×M.A finite set ofn oriented lines in general position in the euclidean plane induces a cell decomposition of the plane. For a givenk-element subset of cells of dimension 2, we define an incidence relationJ × as follows:t _i andl _j are incident if and only ift _i lies on the positive side with respect tol _j .We call a context (G, M, J)represented in a line arrangement if and only if there are relation preserving bijections betweenG and ,M and , respectively. We study conditions for a context to be representable in a line arrangement.Especially, we provide a non-trivial infinite class of contexts which can not be represented in a line arrangement.     

On a tree-partition problem

If $T=(V,E)$ is a tree then – T denotes the additive hereditary property consisting of all graphs that does not contain T as a subgraph. For an arbitrary vertex v of T we deal with a partition of T into two trees $T_1$, $T_2$, so that $V(T_1)\cap V(T_2)=\{v\}$, $V(T_1)\cup (T_2)=V(T)$, $E(T_1)\cap E(T_2)=\varnothing$, $E(T_1)\cup E(T_2)=E(T)$, $T[V(T_1)\backslash \{v\}]\subseteq E(T_1)$ and $T[V(T_2)\backslash \{v\}]\subseteq E(T_2)$. We call such a partition a $T_v-partition$ of T. We study the following em: Given a graph G belonging to –T. Is it true that for any $T_v$-partition $T_1$, $T_2$ of T there exists a partition $\{V_1,V_2\}$ of the vertices of G such that $G[V_1]\in -T_1$ and $G[V_2]\in -T_2$? This problem provides a natural generalization of Δ-partition problem studied by L. Lovász ([L. Lovász, On decomposition of graphs. Studia Sci. Math. Hungar. 1 (1966) 237–238]) and Path Partition Conjecture formulated by P. Mihók ([P. Mihók, Problem 4, in: M. Borowiecki, Z. Skupien (Eds.), Graphs, Hypergraphs and Matroids, Zielona Góra, 1985, p. 86]). We present some partial results and a contribution to the Path Kernel Conjecture that was formulated with connection to Path Partition Conjecture.     

On a differential-algebraic problem

The method of quasilinearization is a procedure for obtaining approximate solutions of differential equations. In this paper, this technique is applied to a differential-algebraic problem. Under some natural assumptions, monotone sequences converge quadratically to a unique solution of our problem.     

On a Smale problem

We derive conditions under which a linear coupling between two globally stable nonlinear nth-order systems results in a system of order 2n whose almost every solution asymptotically approaches an orbitally stable cycle. These results permit one to solve a problem posed by Smale and pertaining to the theory of chemical kinetics of biological cells.     

On a uniqueness problem

We prove a uniqueness theorem for series which are a broad generalization of Dirichlet series. In particular, we obtain a uniqueness theorem for series solutions of differential equations.Translated from Matematicheskie Zametki, Vol. 16, No. 6, pp. 871–878, December, 1974.     

On cohomology algebras of complex subspace arrangements

The integer cohomology algebra of the complement of a complex subspace arrangement with geometric intersection lattice is completely determined by the combinatorial data of the arrangement. We give a combinatorial presentation of the cohomology algebra in the spirit of the Orlik-Solomon result on the cohomology algebras of complex hyperplane arrangements. Our methods are elementary: we work with simplicial models for the complements that are induced by combinatorial stratifications of complex space. We describe simplicial cochains that generate the cohomology. Among them we distinguish a linear basis, study cup product multiplication, and derive an algebra presentation in terms of generators and relations.

     

On a Heilbronn-type problem

Let F be a convex figure with area |F| and let G(n,F) denote the smallest number such that from any n points of F we can get G(n,F) triangles with areas less than or equal to |F|/4. In this article, to generalize some results of Soifer, we will prove that for any triangle T, G(5,T)=3; for any parallelogram P, G(5,P)=2; for any convex figure F, if S(F)=6, then G(6,F)=4.     

On a logical problem

The full solution of a logical problem is given.     

On a Quasi-Ramsey problem

It is proved that if a graph G has atleast cn log n vertices, then either G or its complement G contains a subgraph H with atleast n vertices and minimum degree atleast | V(H)|/2. This result is not far from being best possible, as is shown by a rather unusual random construction. Some related questions are also discussed.