The Topological Tverberg Theorem and winding numbers

The Topological Tverberg Theorem claims that any continuous map of a (q-1)(d+1)-simplex to R^d identifies points from q disjoint faces. (This has been proved for affine maps, for d?1, and if q is a prime power, but not yet in general.)The Topological Tverberg Theorem can be restricted to maps of the d-skeleton of the simplex. We further show that it is equivalent to a “Winding Number Conjecture” that concerns only maps of the (d-1)-skeleton of a (q-1)(d+1)-simplex to R^d. “Many Tverberg partitions” arise if and only if there are “many q-winding partitions.”The d=2 case of the Winding Number Conjecture is a problem about drawings of the complete graphs K_3q-2 in the plane. We investigate graphs that are minimal with respect to the winding number condition.     

A local criterion for Tverberg graphs

The topological Tverberg theorem states that for any prime power q and continuous map from a (d+1)(q−1)-simplex to ℝ ^d , there are q disjoint faces F _i of the simplex whose images intersect. It is possible to put conditions on which pairs of vertices of the simplex that are allowed to be in the same face F _i . A graph with the same vertex set as the simplex, and with two vertices adjacent if they should not be in the same F _i , is called a Tverberg graph if the topological Tverberg theorem still work.     

Tverberg’s Theorem and Graph Coloring

The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions. Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are encoded with graphs. When two points are adjacent in the graph, they are not in the same part. If the restrictions are too harsh, then the topological Tverberg theorem fails. The colored Tverberg theorem corresponds to graphs constructed as disjoint unions of small complete graphs. Hell studied the case of paths and cycles. In graph theory these partitions are usually viewed as graph colorings. As explored by Aharoni, Haxell, Meshulam and others there are fundamental connections between several notions of graph colorings and topological combinatorics. For ordinary graph colorings it is enough to require that the number of colors q satisfy q>Δ, where Δ is the maximal degree of the graph. It was proven by the first author using equivariant topology that if q>Δ ² then the topological Tverberg theorem still works. It is conjectured that q>KΔ is also enough for some constant K, and in this paper we prove a fixed-parameter version of that conjecture. The required topological connectivity results are proven with shellability, which also strengthens some previous partial results where the topological connectivity was proven with the nerve lemma.     

A tight colored Tverberg theorem for maps to manifolds

We prove that any continuous map of an N-dimensional simplex ΔN with colored vertices to a d-dimensional manifold M must map r points from disjoint rainbow faces of ΔN to the same point in M: For this we have to assume that N?(r−1)(d+1), no r vertices of ΔN get the same color, and our proof needs that r is a prime. A face of ΔN is a rainbow face if all vertices have different colors.This result is an extension of our recent “new colored Tverberg theorem”, the special case of M=Rd. It is also a generalization of Volovikov?s 1996 topological Tverberg theorem for maps to manifolds, which arises when all color classes have size 1 (i.e., without color constraints); for this special case Volovikov?s proof, as well as ours, works when r is a prime power.     

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.     

Chessboard complexes indomitable

We give a simpler, degree-theoretic proof of the striking new Tverberg type theorem of Blagojevi?, Ziegler and Matschke. Our method also yields some new examples of “constrained Tverberg theorems” including a simple colored Radon?s theorem for d+3 points in Rd. This gives us an opportunity to review some of the highlights of this beautiful theory and reexamine the role of chessboard complexes in these and related problems of topological combinatorics.     

Lower bounds on covering codes via partition matrices

Let Kq(n,R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Let σq(n,s;r) denote the minimal cardinality of a q-ary code of length n, which is s-surjective with radius r. In order to lower-bound Kq(n,n−2) and σq(n,s;s−2) we introduce partition matrices and their transversals. Our approach leads to a short new proof of a classical bound of Rodemich on Kq(n,n−2) and to the new bound Kq(n,n−2)?3q−2n+2, improving the first iff 5?n<q?2n−4. We determine Kq(q,q−2)=q−2+σ₂(q,2;0) if q?10. Moreover, we obtain the new powerful recursive bound Kq+1(n+1,R+1)?min{2(q+1),Kq(n,R)+1}.     

Uniformly optimal graphs in some classes of graphs with node failures

The uniformly optimal graph problem with node failures consists of finding the most reliable graph in the class Ω(n,m) of all graphs with n nodes and m edges in which nodes fail independently and edges never fail. The graph G is called uniformly optimal in Ω(n,m) if, for all node-failure probabilities q∈(0,1), the graph G is the most reliable graph in the class of graphs Ω(n,m). This paper proves that the multipartite graphs K(b,b+1,…,b+1,b+2) are uniformly optimal in their classes Ω((k+2)(b+1),(k²+3k+2)(b+1)²/2−1), where k is the number of partite sets of size (b+1), while for i>2, the multipartite graphs K(b,b+1,…,b+1,b+i) are not uniformly optimal in their classes Ω((k+2)b+k+i,(k+2)(k+1)b²/2+(k+1)(k+i)b+k(k+2i−1)/2).     

Note on a conjecture of sierksma

LetS(q, d) be the maximal numberv such that, for every general position linear maph: Δ^(q?1)(d+1) →R ^d, there exist at leastv different collections {Δ ^t1, ..., Δ ^t _q} of disjoint faces of Δ(q?1)(d+1) with the property thatf(Δ ^t1) ∩ ... ∩f(Δ ^t _q) ≠ Ø. Sierksma's conjecture is thatS(q, d)=((q?1)!) ^d . The following lower bound (Theorem 1) is proved assuming thatq is a prime number: $$S(q,d) \geqslant \frac{1}{{(q - 1)!}}\left( {\frac{q}{2}} \right)^{{{((q - 1)(d + 1))} \mathord{\left/ {\vphantom {{((q - 1)(d + 1))} 2}} \right. \kern-\nulldelimiterspace} 2}} .$$ Using the same technique we obtain (Theorem 2) a lower bound for the number of different splittings of a “generic” necklace.     

On a conjecture of Brouwer involving the connectivity of strongly regular graphs

In this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum number of vertices of a strongly regular graph whose removal disconnects the graph into non-singleton components.We show that strongly regular graphs constructed from copolar spaces and from the more general spaces called Δ-spaces are counterexamples to Brouwer?s Conjecture. Using J.I. Hall?s characterization of finite reduced copolar spaces, we find that the triangular graphs T(m), the symplectic graphs Sp(2r,q) over the field Fq (for any q prime power), and the strongly regular graphs constructed from the hyperbolic quadrics O⁺(2r,2) and from the elliptic quadrics O⁻(2r,2) over the field F₂, respectively, are counterexamples to Brouwer?s Conjecture. For each of these graphs, we determine precisely the minimum number of vertices whose removal disconnects the graph into non-singleton components. While we are not aware of an analogue of Hall?s characterization theorem for Δ-spaces, we show that complements of the point graphs of certain finite generalized quadrangles are point graphs of Δ-spaces and thus, yield other counterexamples to Brouwer?s Conjecture.We prove that Brouwer?s Conjecture is true for many families of strongly regular graphs including the conference graphs, the generalized quadrangles GQ(q,q) graphs, the lattice graphs, the Latin square graphs, the strongly regular graphs with smallest eigenvalue −2 (except the triangular graphs) and the primitive strongly regular graphs with at most 30 vertices except for few cases.We leave as an open problem determining the best general lower bound for the minimum size of a disconnecting set of vertices of a strongly regular graph, whose removal disconnects the graph into non-singleton components.     

The disconnection number of a graph

The disconnection number d(X) is the least number of points in a connected topological graph X such that removal of d(X) points will disconnect X (Nadler, 1993 [6]). Let Dn denote the set of all homeomorphism classes of topological graphs with disconnection number n. The main result characterizes the members of Dn+1 in terms of four possible operations on members of Dn. In addition, if X and Y are topological graphs and X is a subspace of Y with no endpoints, then d(X)?d(Y) and Y obtains from X with exactly d(Y)−d(X) operations. Some upper and lower bounds on the size of Dn are discussed.The algorithm of the main result has been implemented to construct the classes Dn for n?8, to estimate the size of D₉, and to obtain information on certain subclasses such as non-planar graphs (n?9) and regular graphs (n?10).     

Weyl's theorem for algebraically totally hereditarily normaloid operators

A Banach space operator T∈B(X) is said to be totally hereditarily normaloid, T∈THN, if every part of T is normaloid and every invertible part of T has a normaloid inverse. The operator T is said to be an H(q) operator for some integer q?1, T∈H(q), if the quasi-nilpotent part H₀(T−λ)=(T−λ)^−q(0) for every complex number λ. It is proved that if T is algebraically H(q), or T is algebraically THN and X is separable, then f(T) satisfies Weyl's theorem for every function f analytic in an open neighborhood of σ(T), and T^∗ satisfies a-Weyl's theorem. If also T^∗ has the single valued extension property, then f(T) satisfies a-Weyl's theorem for every analytic function f which is non-constant on the connected components of the open neighborhood of σ(T) on which it is defined.     

Multiple positive solutions to a singular boundary value problem for a superlinear Emden-Fowler equation

A multiplicity result for the singular ordinary differential equation y^″+λx⁻²yσ=0, posed in the interval (0,1), with the boundary conditions y(0)=0 and y(1)=γ, where σ>1, λ>0 and γ?0 are real parameters, is presented. Using a logarithmic transformation and an integral equation method, we show that there exists Σ^?∈(0,σ/2] such that a solution to the above problem is possible if and only if λγσ−1?Σ^?. For 0<λγσ−1<Σ^?, there are multiple positive solutions, while if γ=(λ⁻¹Σ^?)^1/(σ−1) the problem has a unique positive solution which is monotonic increasing. The asymptotic behavior of y(x) as x→⁰⁺ is also given, which allows us to establish the absence of positive solution to the singular Dirichlet elliptic problem −Δu=d⁻²(x)uσ in Ω, where Ω⊂RN, N?2, is a smooth bounded domain and d(x)=dist(x,∂Ω).     

Degree sum conditions for oriented forests in digraphs

Let F be an oriented forest with n vertices and m arcs and D be a digraph without loops and multiple arcs. In this note we prove that D contains a subdigraph isomorphic to F if D has at least n vertices and min{d⁺(u)+d⁺(v),d⁻(u)+d⁻(v),d⁺(u)+d⁻(v)}≥2m−1 for every pair of vertices u,v∈V(D) with uv∉A(D). This is a common generalization of two results of Babu and Diwan, one on the existence of forests in graphs under a degree sum condition and the other on the existence of oriented forests in digraphs under a minimum degree condition.     

Maximal periods of (Ehrhart) quasi-polynomials

A quasi-polynomial is a function defined of the form q(k)=cd(k)kd+cd−1(k)kd−1+?+c₀(k), where c₀,c₁,…,cd are periodic functions in k∈Z. Prominent examples of quasi-polynomials appear in Ehrhart's theory as integer-point counting functions for rational polytopes, and McMullen gives upper bounds for the periods of the cj(k) for Ehrhart quasi-polynomials. For generic polytopes, McMullen's bounds seem to be sharp, but sometimes smaller periods exist. We prove that the second leading coefficient of an Ehrhart quasi-polynomial always has maximal expected period and present a general theorem that yields maximal periods for the coefficients of certain quasi-polynomials. We present a construction for (Ehrhart) quasi-polynomials that exhibit maximal period behavior and use it to answer a question of Zaslavsky on convolutions of quasi-polynomials.     

Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages

Small k-regular graphs of girth g where g=6,8,12 are obtained as subgraphs of minimal cages. More precisely, we obtain (k,6)-graphs on 2(kq−1) vertices, (k,8)-graphs on 2k(q²−1) vertices and (k,12)-graphs on 2kq²(q²−1), where q is a prime power and k is a positive integer such that q≥k≥3. Some of these graphs have the smallest number of vertices known so far among the regular graphs with girth g=6,8,12.     

Labeling graphs with two distance constraints

Given a graph G and integers p,q,d₁ and d₂, with p>q, d₂>d₁?1, an L(d₁,d₂;p,q)-labeling of G is a function f:V(G)→{0,1,2,…,n} such that |f(u)−f(v)|?p if d_G(u,v)?d₁ and |f(u)−f(v)|?q if d_G(u,v)?d₂. A k-L(d₁,d₂;p,q)-labeling is an L(d₁,d₂;p,q)-labeling f such that max_v∈V(G)f(v)?k. The L(d₁,d₂;p,q)-labeling number ofG, denoted by , is the smallest number k such that G has a k-L(d₁,d₂;p,q)-labeling. In this paper, we give upper bounds and lower bounds of the L(d₁,d₂;p,q)-labeling number for general graphs and some special graphs. We also discuss the L(d₁,d₂;p,q)-labeling number of G, when G is a path, a power of a path, or Cartesian product of two paths.     

On tricyclic graphs of a given diameter with minimal energy

The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. Let G(n,d) be the class of tricyclic graphs G on n vertices with diameter d and containing no vertex disjoint odd cycles C_p,C_q of lengths p and q with p+q≡2(mod4). In this paper, we characterize the graphs with minimal energy in G(n,d).     

A logarithm type mean value theorem of the Riemann zeta function

For any integer K?2 and positive integer h, we investigate the mean value of |ζ(σ+it)|^2k×logh|ζ(σ+it)| for all real number 0<k<K and all σ>1−1/K. In case K=2, h=1, this has been studied by Wang in [F.T. Wang, A mean value theorem of the Riemann zeta function, Quart. J. Math. Oxford Ser. 18 (1947) 1-3]. In this note, we give a new brief proof of Wang's theorem, and, with this method, generalize it to the general case naturally.     

A Liouville type theorem for polyharmonic elliptic systems

In this paper, we consider the polyharmonic system m(−Δ)U=Vq,m(−Δ)V=Up in RN, for m>1, N>2m, with p?1, q?1, but not both equal to 1, where m(−Δ) is the polyharmonic operator. Set α=2m(q+1)/(pq−1), β=2m(p+1)/(pq−1), for α,β∈[(N−2)/2,N−2m), we prove the nonexistence of positive solutions.