Related papers: On the Andrews-Curtis conjecture and algorithms fr…
We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…
This paper proposes an algorithm for solving structured optimization problems, which covers both the backward-backward and the Douglas-Rachford algorithms as special cases, and analyzes its convergence. The set of fixed points of the…
We construct a simple topological invariant of certain 3-manifolds, including quotients of the 3-sphere by finite groups, based on the fact that the tangent bundle of an orientable 3-manifold is trivialisable. This invariant is strong…
It has long been known that to a complex cubic surface or threefold one can canonically associate a principally polarized abelian variety. We give a construction which works for cubics over an arithmetic base. This answers, away from the…
There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…
We consider Murre's conjectures on Chow groups for a fourfold which is a product of two curves and a surface. We give a result which concerns Conjecture D:the kernel of a certain projector is equal to the homologically trivial part of the…
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most seven tetrahedra satisfying the additional constraints of minimality and P^2-irreducibility. The eight different 3-manifolds represented by…
Classical results of Milnor, Wood, Mather, and Thurston produce flat connections in surprising places. The Milnor-Wood inequality is for circle bundles over surfaces, whereas the Mather-Thurston Theorem is about cobording general manifold…
Treating a conjecture, P^#P != NP, on the separation of complexity classes as an axiom, an implication is found in three manifold topology with little obvious connection to complexity theory. This is reminiscent of Harvey Friedman's work on…
A general theory of topological classification of defects is introduced. We illustrate the application of tools from algebraic topology, including homotopy and cohomology groups, to classify defects including several explicit calculations…
This dissertation contains a comprehensive study of the topology of 2-manifolds and a complementary analysis of the work done by Edwin E. Moise, L. V. Ahlfors and Ian Richards. Our aim is to study the well known classification of surfaces.…
The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…
Andrews and the third author recently studied congruences for certain restricted two-color partitions. They made two conjectures for Ramanujan-type congruences and a vanishing identity for the limiting sequence. In this paper, we settle…
I settle a conjecture of Andrews related to the Alladi-Schur polynomials. In addition, I give further relations and implications to two families of polynomials related to the Alladi-Schur polynomials.
We prove the $p$-curvature conjecture for rank two vector bundles with connection on generic curves, by combining deformation techniques for families of varieties and topological arguments.
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…
The results of several papers concerning the \v{C}ern\'y conjecture are deduced as consequences of a simple idea that I call the averaging trick. This idea is implicitly used in the literature, but no attempt was made to formalize the proof…
We define and study trivial points on towers of curves over number fields, and we show their finiteness in some cases. We relate these to the unboundeness of the gonality of the curves, which we show under some hypothesis. The problem is…
Unexpectedness is a central concept in Simplicity Theory, a theory of cognition relating various inferential processes to the computation of Kolmogorov complexities, rather than probabilities. Its predictive power has been confirmed by…