On Tverberg partitions

A theorem of Tverberg from 1966 asserts that every set X ? ? ^d of n = T(d, r) = (d + 1)(r ? 1) + 1 points can be partitioned into r pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition induces an integer partition of n into r parts (that is, r integers a ₁,..., a _r satisfying n = a ₁ + ··· + a _r ), in which the parts a _i correspond to the number of points in every subset. In this paper, we prove that for any partition of n where the parts satisfy a _i ≤ d + 1 for all i = 1,..., r, there exists a set X ? ? of n points, such that every Tverberg partition of X induces the same partition on n, given by the parts a ₁,..., a _r .     

Average-value tverberg partitions via finite fourier analysis

The long-standing topological Tverberg conjecture claimed, for any continuous map from the boundary of an N(q, d):= (q-1)(d+1)-simplex to d-dimensional Euclidian space, the existence of q pairwise disjoint subfaces whose images have non-empty q-fold intersection. The affine cases, true for all q, constitute Tverberg’s famous 1966 generalization of the classical Radon’s Theorem. Although established for all prime powers in 1987 by Özaydin, counterexamples to the conjecture, relying on 2014 work of Mabillard and Wagner, were first shown to exist for all non-prime-powers in 2015 by Frick. Starting with a reformulation of the topological Tverberg conjecture in terms of harmonic analysis on finite groups, we show that despite the failure of the conjecture, continuous maps below the tight dimension N(q, d) are nonetheless guaranteed q pairwise disjoint subfaces–including when q is not a prime power–which satisfy a variety of “average value” coincidences, the latter obtained as the vanishing of prescribed Fourier transforms.     

A Note on the Value in the Disjoint Convex Partition Problem

Let P be a planar point set with no three points collinear; k points of P form a k-hole of P if these k points are the vertices of a convex polygon whose interior contains no points of P. Inthis article, we prove that any planar point set containing at least 13 points with no three points collinear contains pairwise disjoint 3-, 4-, and 5-holes if there exists a separating line SL₄.     

On Convex Geometric Graphs with no $$$$ Pairwise Disjoint Edges

A well-known result of Kupitz from 1982 asserts that the maximal number of edges in a convex geometric graph (CGG) on n vertices that does not contain \(k+1\) pairwise disjoint edges is kn (provided \(n>2k\)). For \(k=1\) and \(k=n/2-1\), the extremal examples are completely characterized. For all other values of k, the structure of the extremal examples is far from known: their total number is unknown, and only a few classes of examples were presented, that are almost symmetric, consisting roughly of the kn “longest possible” edges of CK(n), the complete CGG of order n. In order to understand further the structure of the extremal examples, we present a class of extremal examples that lie at the other end of the spectrum. Namely, we break the symmetry by requiring that, in addition, the graph admit an independent set that consists of q consecutive vertices on the boundary of the convex hull. We show that such graphs exist as long as \(q \le n-2k\) and that this value of q is optimal. We generalize our discussion to the following question: what is the maximal possible number f(n, k, q) of edges in a CGG on n vertices that does not contain \(k+1\) pairwise disjoint edges, and, in addition, admits an independent set that consists of q consecutive vertices on the boundary of the convex hull? We provide a complete answer to this question, determining f(n, k, q) for all relevant values of n, k and q.     

Some variations on Tverberg’s theorem

Define T(d, r) = (d + 1)(r - 1) + 1. A well known theorem of Tverberg states that if n ≥ T(d, r), then one can partition any set of n points in R^d into r pairwise disjoint subsets whose convex hulls have a common point. The numbers T(d, r) are known as Tverberg numbers. Reay added another parameter k (2 ≤ k ≤ r) and asked: what is the smallest number n, such that every set of n points in R^d admits an r-partition, in such a way that each k of the convex hulls of the r parts meet. Call this number T(d, r, k). Reay conjectured that T(d, r, k) = T(d, r) for all d, r and k. In this paper we prove Reay’s conjecture in the following cases: when k ≥ [d+3/2], and also when d < rk/r-k - 1. The conjecture also holds for the specific values d = 3, r = 4, k = 2 and d = 5, r = 3, k = 2.     

Intersecting Convex Sets by Rays

What is the smallest number τ=τ(n) such that for any collection of n pairwise disjoint convex sets in d-dimensional Euclidean space, there is a point such that any ray (half-line) emanating from it meets at most τ sets of the collection? This question of Urrutia is closely related to the notion of regression depth introduced by Rousseeuw and Hubert (1996). We show the following:Given any collection \({\mathcal{C}}\) of n pairwise disjoint compact convex sets in d-dimensional Euclidean space, there exists a point p such that any ray emanating from p meets at most \(\frac{dn+1}{d+1}\) members of \({\mathcal{C}}\).There exist collections of n pairwise disjoint (i) equal-length segments or (ii) disks in the Euclidean plane such that from any point there is a ray that meets at least \(\frac{2n}{3}-2\) of them.We also determine the asymptotic behavior of τ(n) when the convex bodies are fat and of roughly equal size.     

Symmetric quasi-norms of sums of independent random variables in symmetric function spaces with the Kruglov property

Let X be a symmetric Banach function space on [0, 1] and let E be a symmetric (quasi)-Banach sequence space. Let f = {f _k } _k=1 ⁿ , n ≥ 1 be an arbitrary sequence of independent random variables in X and let {e _k } _k=1 ^∞ ? E be the standard unit vector sequence in E. This paper presents a deterministic characterization of the quantity

$||||\sum\limits_{k = 1}^n {{f_k}{e_k}|{|_E}|{|_X}} $

in terms of the sum of disjoint copies of individual terms of f. We acknowledge key contributions by previous authors in detail in the introduction, however our approach is based on the important recent advances in the study of the Kruglov property of symmetric spaces made earlier by the authors. Authors acknowledge support from the ARC.

     

Behavior of the Fourier–Walsh coefficients of a corrected function

We prove that, given a sequence {ak}_k=1^∞ with a_k ↓ 0 and {ak}_k=1^∞ ? l₂, reals 0 < ε < 1 and p ∈ [1, 2], and f ∈ L^p(0, 1), we can find f ∈ L^p(0, 1) with mes{f ≠ f < ε whose nonzero Fourier–Walsh coefficients c_k(f) are such that |c_k(f)| = a_k for k ∈ spec(f).     

Estimates for sums of moduli of blocks in trigonometric Fourier series

We consider the following two problems. Problem 1: what conditions on a sequence of finite subsets A _k ? ? and a sequence of functions λ _k : A _k → ? provide the existence of a number C such that any function f ∈ L ₁ satisfies the inequality ‖U _A,Λ(f)‖ _p ≤ C‖f‖₁ and what is the exact constant in this inequality? Here, \(U_{\mathcal{A},\Lambda } \left( f \right)\left( x \right) = \sum\nolimits_{k = 1}^\infty {\left| {\sum\nolimits_{m \in A_k } {\lambda _k \left( m \right)c_m \left( f \right)e^{imx} } } \right|}\) and c _m (f) are Fourier coefficients of the function f ∈ L ₁. Problem 2: what conditions on a sequence of finite subsets A _k ? ? guarantee that the function \(\sum\nolimits_{k = 1}^\infty {\left| {\sum\nolimits_{m \in A_k } {c_m \left( h \right)e^{imx} } } \right|}\) belongs to L _p for every function h of bounded variation?     

Disjoint cliques in claw-free graphs

A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to K_1,3. Let s and k be two integers with 0 ≤ s ≤ k and let G be a claw-free graph of order n. In this paper, we investigate clique partition problems in claw-free graphs. It is proved that if n ≥ 3s+4(k?s) and d(x)+d(y) ≥ n?2s+2k+1 for any pair of non-adjacent vertices x, y of G, then G contains s disjoint K₃s and k ? s disjoint K₄s such that all of them are disjoint. Moreover, the degree condition is sharp in some cases.     

An improved approximation algorithm for the <Emphasis Type="Italic">k</Emphasis>-level facility location problem with soft capacities

We consider the k-level facility location problem with soft capacities (k-LFLPSC). In the k-LFLPSC, each facility i has a soft capacity u _i along with an initial opening cost f _i ≥ 0, i.e., the capacity of facility i is an integer multiple of u _i incurring a cost equals to the corresponding multiple of f _i . We firstly propose a new bifactor (ln(1/β)/(1 ?β),1+2/(1 ?β))-approximation algorithm for the k-level facility location problem (k-LFLP), where β ∈ (0, 1) is a fixed constant. Then, we give a reduction from the k-LFLPSC to the k-LFLP. The reduction together with the above bifactor approximation algorithm for the k-LFLP imply a 5.5053-approximation algorithm for the k-LFLPSC which improves the previous 6-approximation.     

Semialgebraic sets and the Łojasiewicz-Siciak condition

The paper contains a full geometric characterization of compact semialgebraic sets in C satisfying the ?ojasiewicz-Siciak condition. The ?ojasiewicz-Siciak condition is a certain estimate for the Siciak extremal function. In a previous paper, we gave a sufficient criterion for a compact, connected, and semialgebraic set in C to satisfy this condition. In the present paper, we remove completely the connectedness assumption and prove that the aforementioned sufficient condition is also necessary. Moreover, we obtain some new results concerning the ?ojasiewicz-Siciak condition in C^N. For example, we prove that if K₁,...,K_p are compact, nonpluripolar, and pairwise disjoint subsets of C^N, each satisfying the ?ojasiewicz-Siciak condition, and K:= K₁?· · ·?K_p is polynomially convex, then K satisfies this condition as well.     

Proof of the Erdős matching conjecture in a new range

Let s > k ≧ 2 be integers. It is shown that there is a positive real ε = ε(k) such that for all integers n satisfying (s + 1)k ≦ n < (s + 1)(k + ε) every k-graph on n vertices with no more than s pairwise disjoint edges has at most \(\left( {\begin{array}{*{20}{c}} {\left( {s + 1} \right)k - 1} \\ k \end{array}} \right)\) edges in total. This proves part of an old conjecture of Erd?s.     

Regularized traces of singular differential operators with canonical boundary conditions

A self-adjoint differential operator \(\mathbb{L}\) of order 2m is considered in L ₂[0,∞) with the classic boundary conditions \(y^{(k_1 )} (0) = y^{(k_2 )} (0) = y^{(k_3 )} (0) = \ldots = y^{(k_m )} (0) = 0\), where 0 ≤ k ₁ < k ₂ < ... < k _m ≤ 2m ? 1 and {k _s } _s=1 ^m ∪ {2m ? 1 ? k _s } _s=1 ^m = {0, 1, 2, ..., 2m ? 1}. The operator \(\mathbb{L}\) is perturbed by the operator of multiplication by a real measurable bounded function q(x) with a compact support: \(\mathbb{P}\) f(x) = q(x)f(x), f ∈ L ₂[0,∞). The regularized trace of the operator \(\mathbb{L} + \mathbb{P}\) is calculated.     

On Templeman averages and variation functions

Let S be a countable semigroup acting in a measure-preserving fashion (g ? T _g ) on a measure space (Ω, A, µ). For a finite subset A of S, let |A| denote its cardinality. Let (A _k ) _k=1 ^∞ be a sequence of subsets of S satisfying conditions related to those in the ergodic theorem for semi-group actions of A. A. Tempelman. For A-measureable functions f on the measure space (Ω, A, μ) we form for k ≥ 1 the Templeman averages \(\pi _k (f)(x) = \left| {A_k } \right|^{ - 1} \sum\nolimits_{g \in A_k } {T_g f(x)}\) and set V _q f(x) = (Σ _k≥1|π _k+1(f)(x) ? π _k (f)(x)|q)^1/q when q ∈ (1, 2]. We show that there exists C > 0 such that for all f in L ¹(Ω, A, µ) we have µ({x ∈ Ω: V _q f(x) > λ}) ≤ C(∫_Ω | f | dµ/λ). Finally, some concrete examples are constructed.     

Normal families of meromorphic functions and shared functions

The paper is devoted to the normal families of meromorphic functions and shared functions. Generalizing a result of Chang (2013), we prove the following theorem. Let h (≠≡ 0,∞) be a meromorphic function on a domain D and let k be a positive integer. Let F be a family of meromorphic functions on D, all of whose zeros have multiplicity at least k + 2, such that for each pair of functions f and g from F, f and g share the value 0, and f^(k) and g^(k) share the function h. If for every f ∈ F, at each common zero of f and h the multiplicities m_f for f and m_h for h satisfy m_f ≥ m_h + k + 1 for k > 1 and m_f ≥ 2m_h + 3 for k = 1, and at each common pole of f and h, the multiplicities nf for f and nh for h satisfy n_f ≥ n_h + 1, then the family F is normal on D.     

Jacobi Maaß forms

In this paper, we give a new definition for the space of non-holomorphic Jacobi Maaß forms (denoted by J _k,m ^nh ) of weight k∈? and index m∈? as eigenfunctions of a degree three differential operator \(\mathcal{C}^{k,m}\). We show that the three main examples of Jacobi forms known in the literature: holomorphic, skew-holomorphic and real-analytic Eisenstein series, are contained in J _k,m ^nh . We construct new examples of cuspidal Jacobi Maaß forms F _f of weight k∈2? and index 1 from weight k?1/2 Maaß forms f with respect to Γ₀(4) and show that the map f ? F _f is Hecke equivariant. We also show that the above map is compatible with the well-known representation theory of the Jacobi group. In addition, we show that all of J _k,m ^nh can be “essentially” obtained from scalar or vector valued half integer weight Maaß forms.     

On a question by Corson about point-finite coverings

We answer in the affirmative the following question raised by H. H. Corson in 1961: “Is it possible to cover every Banach space X by bounded convex sets with non-empty interior in such a way that no point of X belongs to infinitely many of them?”Actually, we show the way to produce in every Banach space X a bounded convex tiling of order 2, i.e., a covering of X by bounded convex closed sets with non-empty interior (tiles) such that the interiors are pairwise disjoint and no point of X belongs to more than two tiles.     

Vertex-fault-tolerant cycles embedding on enhanced hypercube networks

In this paper, we focus on the vertex-fault-tolerant cycles embedding on enhanced hypercube, which is an attractive variant of hypercube and is obtained by adding some complementary edges from hypercube. Let F _v be the set of faulty vertices in the n-dimensional enhanced hypercube Q _n,k (1 ≤ k ≤ n?1). When |F _v | = 2, we showed that Q _n,k ? F _v contains a fault-free cycle of every even length from 4 to 2 ⁿ ?4 where n (n ≥ 3) and k have the same parity; and contains a fault-free cycle of every even length from 4 to 2 ⁿ ? 4, simultaneously, contains a cycle of every odd length from n ? k + 2 to 2 ⁿ ? 3 where n(≥ 3) and k have the different parity. Furthermore, when |F ^v | = f ^v ≤ n ? 2, we proof that there exists the longest fault-free cycle, which is of even length 2 ⁿ ? 2f ^v whether n(n ≥ 3) and k have the same parity or not; and there exists the longest fault-free cycle, which is of odd length 2 ⁿ ? 2f ^v ? 1 in Q ^n,k ? F ^v where n(≥ 3) and k have the different parity.     

Local solvability of the k-Hessian equations

We give a classification of second-order polynomial solutions for the homogeneous k-Hessian equation σ_k[u] = 0. There are only two classes of polynomial solutions: One is convex polynomial; another one must not be(k + 1)-convex, and in the second case, the k-Hessian equations are uniformly elliptic with respect to that solution. Based on this classification, we obtain the existence of C∞local solution for nonhomogeneous term f without sign assumptions.