932 research outputs found
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits
We deploy algebraic complexity theoretic techniques for constructing
symmetric determinantal representations of for00504925mulas and weakly skew
circuits. Our representations produce matrices of much smaller dimensions than
those given in the convex geometry literature when applied to polynomials
having a concise representation (as a sum of monomials, or more generally as an
arithmetic formula or a weakly skew circuit). These representations are valid
in any field of characteristic different from 2. In characteristic 2 we are led
to an almost complete solution to a question of B\"urgisser on the
VNP-completeness of the partial permanent. In particular, we show that the
partial permanent cannot be VNP-complete in a finite field of characteristic 2
unless the polynomial hierarchy collapses.Comment: To appear in the AMS Contemporary Mathematics volume on
Randomization, Relaxation, and Complexity in Polynomial Equation Solving,
edited by Gurvits, Pebay, Rojas and Thompso
Projective geometries arising from Elekes-Szab\'o problems
We generalise the Elekes-Szab\'o theorem to arbitrary arity and dimension and
characterise the complex algebraic varieties without power saving. The
characterisation involves certain algebraic subgroups of commutative algebraic
groups endowed with an extra structure arising from a skew field of
endomorphisms. We also extend the Erd\H{o}s-Szemer\'edi sum-product phenomenon
to elliptic curves. Our approach is based on Hrushovski's framework of
pseudo-finite dimensions and the abelian group configuration theorem.Comment: 48 pages. Minor improvements in presentation. To appear in ASEN
A structural characterisation of Av(1324) and new bounds on its growth rate
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of 1324-avoiders as a subclass of an infinite staircase grid class, together with precise asymptotics of a small domino subclass whose enumeration we relate to West-two-stack-sortable permutations and planar maps. The bounds are established by carefully combining copies of the dominoes in particular ways consistent with the structural characterisation. The lower bound depends on concentration results concerning the substructure of a typical domino, the determination of exactly when dominoes can be combined in the fewest distinct ways, and technical analysis of the resulting generating function
Recommended from our members
Problems and results on linear hypergraphs
In this thesis, we tackle several problems involving the study of 3-uniform, linear hypergraphs satisfying some additional structural constraint.
We begin with a problem of Hrushovski concerning Latin squares satisfying a partial associativity condition. From an Latin square one can define a binary operation , and is associative if and only if is a group multiplication table. Hrushovski asked whether, if is only associative a positive proportion of the time, must still in some sense be close to a group multiplication table. This problem manifests a well-studied combinatorial theme, in which a local structural constraint is relaxed (first to a `99' version and then to a `1' version) and the global consequences of the relaxed constraints are analysed. We show that the partial associativity condition is sufficient to deduce powerful global information, allowing us to find within a large subset with group-like structure. Since Latin squares can be regarded as 3-uniform, linear hypergraphs, and the partial associativity condition can be formulated in terms of the count of a particular subhypergraph, we are able to apply purely combinatorial methods to a problem that touches algebra, model theory and geometric group theory.
We then take this problem further. A condition due to Thomsen provides a combinatorial constraint which, if satisfied by the Latin square , proves that is in fact the multiplication table of an abelian group. It is then natural to ask whether a relaxed version of this result is also attainable, and by extending our methods we are able to prove a result of this flavour. Since the combinatorial obstructions to commutativity of are far more complex than those for associativity, topological complications arise that are not present in the earlier work.
We also study a problem of Loh concerning sequences of triples of integers from satisfying a certain `increasing' property. Loh studied the maximum length of such a sequence, improving a trivial upper bound of to using the triangle removal lemma and conjecturing that a natural construction of length is best possible. We provide the first power-type improvement to the upper bound, showing that there exists such that the length is bounded by . By viewing the triples as edges in a 3-uniform hypergraph, the increasing property shows that the hypergraph is linear and provides further restrictions in terms of forbidden subhypergraphs. By considering this formulation, we provide links to various important open problems including the Brown--Erd\H os--S\'os conjecture.
Finally, we present a collection of shorter results. In work connecting to the earlier chapters, we resolve the Brown--Erd\H os--S\'os conjecture in the context of hypergraphs with a group structure, and show moreover that subsets of group multiplication tables exhibit local density far beyond what can be hoped for in general. In work less closely connected to the main theme of the thesis, we also answer a question of Leader, Mili\'cevi\'c and Tan concerning partitions of boxes, consider a problem on projective cubes in , and resolve a conjecture concerning a diffusion process on graphs
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
We study the variant of the Euclidean Traveling Salesman problem where instead of a set of points, we are given a set of lines as input, and the goal is to find the shortest tour that visits each line. The best known upper and lower bounds for the problem in , with , are -hardness and an -approximation algorithm which is based on a reduction to the group Steiner tree problem. We show that TSP with lines in is APX-hard for any . More generally, this implies that TSP with -dimensional flats does not admit a PTAS for any unless , which gives a complete classification of the approximability of these problems, as there are known PTASes for (i.e., points) and (hyperplanes). We are able to give a stronger inapproximability factor for by showing that TSP with lines does not admit a -approximation in dimensions under the unique games conjecture. On the positive side, we leverage recent results on restricted variants of the group Steiner tree problem in order to give an -approximation algorithm for the problem, albeit with a running time of
Characterizing 2-crossing-critical graphs
It is very well-known that there are precisely two minimal non-planar graphs:
and (degree 2 vertices being irrelevant in this context). In
the language of crossing numbers, these are the only 1-crossing-critical
graphs: they each have crossing number at least one, and every proper subgraph
has crossing number less than one. In 1987, Kochol exhibited an infinite family
of 3-connected, simple 2-crossing-critical graphs. In this work, we: (i)
determine all the 3-connected 2-crossing-critical graphs that contain a
subdivision of the M\"obius Ladder ; (ii) show how to obtain all the
not 3-connected 2-crossing-critical graphs from the 3-connected ones; (iii)
show that there are only finitely many 3-connected 2-crossing-critical graphs
not containing a subdivision of ; and (iv) determine all the
3-connected 2-crossing-critical graphs that do not contain a subdivision of
.Comment: 176 pages, 28 figure
- …