On sets having finitely many points of local nonconvexity and propertyP m

If a pointq ofS has the property that each neighborhood ofq contains pointsx andy such that the segmentxy is not contained byS, q is called a point of local nonconvexity ofS. LetQ denote the set of points of local nonconvexity ofS. Tietze’s well known theorem that a closed connected setS in a linear topological space is convex ifQ=φ is generalized in the result:If S is a closed set in a linear topological space such that S ∼ Q is connected and |Q|=n<∞,then S is the union of n+1or fewer closed convex sets. Letk be the minimal number of convex sets needed in a convex covering ofS. Bounds fork in terms ofm andn are obtained for sets having propertyP _m and |Q|=n.     

AnR danalogue of Valentine’s theorem on 3-convex sets

This paper deals with anR ^danalogue of a theorem of Valentine which states that a closed 3-convex setS in the plane is decomposable into 3 or fewer closed convex sets. In Valentine’s proof, the points of local nonconvexity ofS are treated as vertices of a polygonP contained in the kernel ofS, yielding a decomposition ofS into 2 or 3 convex sets, depending on whetherP has an even or odd number of edges. Thus the decomposition actually depends onc(P′), the chromatic number of the polytopeP′ dual toP. A natural analogue of this result is the following theorem: LetS be a closed subset ofR ^d, and letQ denote the set of points of local nonconvexity ofS. We require thatQ be contained in the kernel ofS and thatQ coincide with the set of points in the union of all the (d − 2)-dimensional faces of somed-dimensional polytopeP. ThenS is decomposable intoc(P′) closed convex sets.     

On a problem of Erdős concerning property B

A family ℱ of sets has propertyB if there exists a setS such thatS∩F≠0 andS⊄F for everyF∈ℱ. ℱ has propertyB(s) if there exists a setS such that 0<|F∩S|<s for everyF∈ℱ. Denote bym(n) (respectivelym(n, s)) the size of a smallest family ofn-element sets not having propertyB (respectivelyB(s)). P. Erdős has asked whetherm(n, s)≧m (s) for alln≧s. We show that, in general, this inequality does not hold.     

Construction of minimal cocycles arising from specific differential equations

Blending methods of Topological Dynamics and Control Theory, we develop a new technique to construct compact-Lie-group-valued minimal cocycles arising as fundamental matrix solutions of linear differential equations with recurrent coefficients subject to a given constraint. The precise requirement on the coefficients is that they belong to a specified closed convex subsetS of the Lie algebraL of the Lie group. Our result is proved for a very thin class of cocycles, since the dimension ofS is allowed to be much smaller than that ofL, and the only assumption onS is thatL ₀(S) =L, whereL ₀(S) is the ideal ofL(S) generated by the difference setS − S, andL(S) is the Lie subalgebra ofL generated byS. This covers a number of differential equations arising in Mathematical Physics, and applies in particular to the widely studied example of the Rabi oscillator. Supported in part by a Research Council grant from Rutgers University. Supported in part by NSF Grant DMS92-02554.     

A decomposition theorem form-convex sets

LetS be a closedm-convex subset of the plane,m≧2,Q the set of points of local nonconvexity ofS, with convQ ⊆S. If there is some pointp in [(bdryS) ∩ (kerS)] ∼Q, thenS is a union ofm−1 closed convex sets. The result is best possible for everym.     

On a class of some special sets on thek-skeleton of a convex compact set

In this paper, generalizing the notion of a path we define ak-area to be the setD={g(t):t ∈J} on thek-skeleton of a convex compact setK in a Hilbert space, whereg is a continuous injection map from thek-dimensional convex compact setJ to thek-skeleton ofK. We also define anE ^k-area onK, whereE ^k is ak-dimensional subspace, to be ak-area with the propertyπ(g(t))=t,t ∈π(K), whereπ is the orthogonal projection onE ^k. This definition generalizes the notion of an increasing path on the 1-skeleton ofK. The existence of such sets is studied whenK is a subset of a Euclidean space or of a Hilbert space. Finally some conjectures are quoted for the number of such sets in some special cases.     

Strong approximation ofGSBV functions by piecewise smooth functions

Let Ω be an open and bounded subset ofR ⁿ with locally Lipschitz boundary. We prove that the functionsv∈SBV(Ω,R ^m ) whose jump setS _vis essentially closed and polyhedral and which are of classW ^{k, ∞} (S _v,R ^m) for every integerk are strongly dense inGSBV ^p(Ω,R ^m ), in the sense that every functionu inGSBV ^p(Ω,R ^m ) is approximated inL ^p(Ω,R ^m ) by a sequence of functions {v _k{_j∈N with the described regularity such that the approximate gradients ∇v _jconverge inL ^p(Ω,R ^nm ) to the approximate gradient ∇u and the (n−1)-dimensional measure of the jump setsS _{v j} converges to the (n−1)-dimensional measure ofS _u. The structure ofS _v can be further improved in casep≤2.

---

Sunto Sia Ω un aperto limitato diR ⁿ con frontiera localmente Lipschitziana. In questo lavoro si dimostra che le funzioniv∈SBV(Ω,R ^m ) con insieme di saltoS _v essenzialmente chiuso e poliedrale che sono di classeW ^{k, ∞} (S _v,R ^m ) per ogni interok sono fortemente dense inGSBV ^p(Ω,R ^m ), nel senso che ogni funzioneu∈GSBV ^p(Ω,R ^m ) è approssimata inL ^p(Ω,R ^m ) da una successione di funzioni {v _j}_j∈N con la regolaritá descritta tali che i gradienti approssimati ∇v _jconvergono inL ^p(Ω,R ^nm ) al gradiente approssimato ∇u e la misura (n−1)-dimensionale degli insiemi di saltoS _{v j}converge alla misura (n−1)-dimensionale diS _u. La struttura diS _vpuó essere migliorata nel caso in cuip≤2.

     

Cantor-Bendixson degrees and convexity in ℝ2

We present an ordinal rank, δ³, which refines the standard classification of non-convexity among closed planar sets. The class of closed planar sets falls into a hierarchy of order type ω₁ + 1 when ordered by δ-rank. The rank δ³ (S) of a setS is defined by means of topological complexity of 3-cliques in the set. A 3-clique in a setS is a subset ofS all of whose unordered 3-tuples fail to have their convex hull inS. Similarly, δⁿ (S) is defined for alln>1. The classification cannot be done using δ², which considers only 2-cliques (known in the literature also as “visually independent subsets”), and in dimension 3 or higher the analogous classification is not valid.     

Conjecture of Li and Praeger concerning the isomorphisms of Cayley graphs of A5

LetG be a finite group, andS a subset ofG \ |1| withS =S ⁻¹. We useX = Cay(G,S) to denote the Cayley graph ofG with respect toS. We callS a Cl-subset ofG, if for any isomorphism Cay(G,S) ≈ Cay(G,T) there is an α∈ Aut(G) such thatS ^α =T. Assume that m is a positive integer.G is called anm-Cl-group if every subsetS ofG withS =S ⁻¹ and | S | ≤m is Cl. In this paper we prove that the alternating groupA ₅ is a 4-Cl-group, which was a conjecture posed by Li and Praeger.     

On the intersection of maximalm-convex subsets

A subsetS of a real linear spaceE is said to bem-convex providedm≧2, there exist more thanm points inS, and for eachm distinct points ofS at least one of the ( ₂ ^m ) segments between thesem points is included inS. InE, letxy denote the segment between two pointsx andy. For any pointx inSυE, letS _x ={y: xyυS}. The kernel of a setS is then defined as {xεS: S _x=S}. It is shown that the kernel of a setS is always a subset of the intersection of all maximalm-convex subsets ofS. A sufficient condition is given for the intersection of all the maximalm-convex subsets of a setS to be the kernel ofS.     

On the Structure of Graphs with Bounded Asteroidal Number

 A set A⊆V of the vertices of a graph G=(V,E) is an asteroidal set if for each vertex a∈A, the set A\{a} is contained in one component of G−N[a]. The maximum cardinality of an asteroidal set of G, denoted by an (G), is said to be the asteroidal number of G. We investigate structural properties of graphs of bounded asteroidal number. For every k≥1, an (G)≤k if and only if an (H)≤k for every minimal triangulation H of G. A dominating target is a set D of vertices such that D∪S is a dominating set of G for every set S such that G[D∪S] is connected. We show that every graph G has a dominating target with at most an (G) vertices. Finally, a connected graph G has a spanning tree T such that d _T (x,y)−d _G (x,y)≤3·|D|−1 for every pair x,y of vertices and every dominating target D of G. Received: July 3, 1998 Final version received: August 10, 1999     

Isoperimetric inequalities on minimal submanifolds of space forms

For a domainU on a certaink-dimensional minimal submanifold ofS ⁿ orH ⁿ, we introduce a “modified volume”M(U) ofU and obtain an optimal isoperimetric inequality forU k ^k ω _k M (D) ^k-1 ≤Vol(∂D) ^k , where ω _k is the volume of the unit ball ofR ^k . Also, we prove that ifD is any domain on a minimal surface inS ₊ ⁿ (orH ⁿ, respectively), thenD satisfies an isoperimetric inequality2π A≤L ²+A² (2π A≤L²−A² respectively). Moreover, we show that ifU is ak-dimensional minimal submanifold ofH ⁿ, then(k−1) Vol(U)≤Vol(∂U). Supported in part by KME and GARC     

Semigroup actions on homogeneous spaces

LetG be a connected semi-simple Lie group with finite center andS⊄G a subsemigroup with interior points. LetG/L be a homogeneous space. There is a natural action ofS onG/L. The relationx≤y ify ∈Sx, x, y ∈G/L, is transitive but not reflexive nor symmetric. Roughly, a control set is a subsetD ⊄G/L, inside of which reflexivity and symmetry for ≤ hold. Control sets are studied inG/L whenL is the minimal parabolic subgroup. They are characterized by means of the Weyl chambers inG meeting intS. Thus, for eachw ∈W, the Weyl group ofG, there is a control setD _w .D ₁ is the only invariant control set, and the subsetW(S)={w:D _w =D ₁} turns out to be a subgroup. The control sets are determined byW(S)/W. The following consequences are derived: i)S=G ifS is transitive onG/H, i.e.Sx=G/H for allx ∈G/H. HereH is a non discrete closed subgroup different fromG andG is simple. ii)S is neither left nor right reversible ifS #G iii)S is maximal only if it is the semigroup of compressions of a subset of some minimal flag manifold. Research partially supported by CNPq grant n^o 50.13.73/91-8     

Separating convex sets in the plane

Given a setA inR ² and a collectionS of plane sets, we say that a lineL separatesA fromS ifA is contained in one of the closed half-planes defined byL, while every set inS is contained in the complementary closed half-plane.We prove that, for any collectionF ofn disjoint disks inR ², there is a lineL that separates a disk inF from a subcollection ofF with at least (n–7)/4 disks. We produce configurationsH _n andG _n , withn and 2n disks, respectively, such that no pair of disks inH _n can be simultaneously separated from any set with more than one disk ofH _n , and no disk inG _n can be separated from any subset ofG _n with more thann disks.We also present a setJ _m with 3m line segments inR ², such that no segment inJ _m can be separated from a subset ofJ _m with more thanm+1 elements. This disproves a conjecture by N. Alonet al. Finally we show that ifF is a set ofn disjoint line segments in the plane such that they can be extended to be disjoint semilines, then there is a lineL that separates one of the segments from at least n/3+1 elements ofF.     

Projective and indecomposableS-acts

LetS be a semigroup andE the set of all idempotents inS. LetS-Act be the category of allS-acts. LetC be a full subcategory ofS-Act which contains_s S and is closed under coproducts and summands. It is proved that, inC, anS-actP is projective and unitary if and only ifP≅ ∐ _{jϕ I} Se _i ,e _i ϕE. In particular,P is a projective, indecomposable and unitary object if and only ifP ≅Se for somee ∈E. These generalize some results obtained by Knauer and Talwar. Research partially supported by a UGC (HK) (Grant No. 2160092).     

On the weak non-defectivity of veronese embeddings of projective spaces

Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<( _n ^n+x ). Here we prove that the order x Veronese embedding ofP ⁿ is not weakly (k−1)-defective, i.e. for a general S⊃P ⁿ such that #(S) = k+1 the projective space | I _2S (x)| of all degree t hypersurfaces ofP ⁿ singular at each point of S has dimension ( _n ^/n+x )−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I _2S (x)| has an ordinary double point at each P∈ S and Sing (F)=S. The author was partially supported by MIUR and GNSAGA of INdAM (Italy).     

On the expected number of k-sets

Given a setS ofn points inR ^d , a subsetX of sized is called ak-simplex if the hyperplane aff(X) has exactlyk points on one side. We studyE _d (k,n), the expected number of k-simplices whenS is a random sample ofn points from a probability distributionP onR ^d . WhenP is spherically symmetric we prove thatE _d (k, n)≤cn ^d−1 WhenP is uniform on a convex bodyK⊂R ² we prove thatE ₂ (k, n) is asymptotically linear in the rangecn≤k≤n/2 and whenk is constant it is asymptotically the expected number of vertices on the convex hull ofS. Finally, we construct a distributionP onR ² for whichE ₂((n−2)/2,n) iscn logn. The authors express gratitude to the NSF DIMACS Center at Rutgers and Princeton. The research of I. Bárány was supported in part by Hungarian National Science Foundation Grants 1907 and 1909, and W. Steiger's research was supported in part by NSF Grants CCR-8902522 and CCR-9111491.     

P4k?1-factorization of bipartite multigraphs

Let λK _m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P _v-factorization of λK _m,n is a set of edge-disjoint P _v -factors of λK _m,n which partition the set of edges of λK _m,n. When v is an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P _v -factorization of λK _m,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true for v = 3. In this paper we will show that the conjecture is true when v = 4k − 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P _4k−1-factorization of λK _m,n is (1) (2k − 1)m ⩽ 2kn, (2) (2k − 1)n ⩽ 2km, (3) m + n ≡ 0 (mod 4k − 1), (4) λ(4k − 1)mn/[2(2k − 1)(m + n)] is an integer.     

Projective and indecomposableS-acts

LetS be a semigroup andE the set of all idempotents inS. LetS-Act be the category of allS-acts. LetC be a full subcategory ofS-Act which contains_s S and is closed under coproducts and summands. It is proved that, inC, anS-actP is projective and unitary if and only ifP≅ ∐ _{jϕ I} Se _i ,e _i ϕE. In particular,P is a projective, indecomposable and unitary object if and only ifP ≅Se for somee ∈E. These generalize some results obtained by Knauer and Talwar.     

Families of finite sets with three intersections

LetX be a finite set ofn elements and ℓ a family ofk-subsets ofX. Suppose that for a given setL of non-negative integers all the pairwise intersections of members of ℓ have cardinality belonging toL. Letm(n, k, L) denote the maximum possible cardinality of ℓ. This function was investigated by many authors, but to determine its exact value or even its correct order of magnitude appears to be hopeless. In this paper we investigate the case |L|=3. We give necessary and sufficient conditions form(n, k, L)=O(n) andm(n, k, L)≧O(n ²), and show that in some casesm(n, k, L)=O(n ^3/2), which is quite surprising.