arXiv research

The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which are Nielsen transformations augmented by arbitrary conjugations. It is a prevalent opinion that this conjecture is false; however, not many p…

Study of transformations in 3-manifolds with boundary and their equivalence classes.

Establishes bounds on Andrews-Curtis moves for trivial group presentations.

We relate the Andrews-Curtis conjecture to the triviality problem for balanced presentations of groups using algorithms from 3-manifold topology. Implementing this algorithm could lead to counterexamples to the Andrews-Curtis conjecture.

Paper proves contractible fake surfaces up to complexity 6 are deformable.

New findings on 3-manifolds using Heegaard Floer theory.

We show that the Andrews-Curtis conjecture holds for all balanced presentations of the trivial group corresponding to Heegaard diagrams of $S^3$.

Motivated by problems in topology, we explore the complexity of balanced group presentations. We obtain large lower bounds on the complexity of Andrews-Curtis trivialisations, beginning in rank 4. Our results are based on a new understanding of how Dehn functions of groups behave under certain kinds of push-outs. We co…

It is shown that the original Andrews--Curtis conjecture on balanced presentations of the trivial group is equivalent to its "cyclic" version in which, in place of arbitrary conjugations, one can use only cyclic permutations. This, in particular, proves a satellite conjecture of Andrews and Curtis made in 1966. We also…

Let $G$ be a group with a finite balanced presentation $P$. We associate a Heegaard Floer homology group $\widehat{HF}_P(G)$ with the pair $(G,P)$ based on some extra choices and technical assumptions. We show that $\widehat{HF}_P(G)$ is independent from these choices and also is invariant under stable Andrews-Curtis t…

New method shows certain group presentations are trivial.

We introduce a novel combinatorial method to study $Q^{**}$-transformations of group presentations or, equivalently, 3-deformations of CW-complexes of dimension 2. Our procedure is based on a refinement of discrete Morse theory that gives a Whitehead simple homotopy equivalence from a regular CW-complex to the simplifi…

Two simple homotopy equivalent 2-complexes K2 and L2 are related by an algebraic criterion of their corresponding presentations as stated in [HoMeSier]. Frank Quinn set it into a topological context (see [Qu1]) and call these 2-complexes related by an s-move. Using elementary 3-expansions, K2 extends to 3-cells in K3 r…

Proves universal pairing result for 2-complexes, showing lack of positivity.

Study shows challenges in reinforcement learning math problems, proposing enhancements and a hardness measure.

Classifies fake surfaces up to complexity 5.

We prove that the presentations $\langle x,y | [x,y],1 \rangle$ and $\langle x,y | [x,[x,y^{-1}]]^2y[y^{-1},x]y^{-1},[x,[[y^{-1},x],x]] \rangle$ are not $Q^*$-equivalent even though their standard complexes have the same simple homotopy type.

The stable Andrews-Curtis conjecture in combinatorial group theory is the statement that every balanced presentation of the trivial group can be simplified to the trivial form by elementary moves corresponding to "handle-slides" together with "stabilization" moves. Schoenflies conjecture is the statement that the compl…

Mathematical Reinforcement Learning faces a 'Two-Hump' problem due to sparse rewards and a scarcity of intermediate 'hard-but-solvable' instances.

We show that a compact n-polyhedron PL embeds in a product of n trees if and only if it collapses onto an (n-1)-polyhedron. If the n-polyhedron is contractible and n\ne 3 (or n=3 and the Andrews-Curtis Conjecture holds), the product of trees may be assumed to collapse onto the image of the embedding. In contrast, there…

New 5-manifold without 'spine' challenges deformation conjecture.

Given a semisimple stable autonomous tensor category over a field $K$, to any group presentation with finite number of generators we associate an element $Q(P)\in K$ invariant under the Andrews-Curtis moves. We show that in fact, this is the same invariant as the one produced by the algorithm of Frank Quinn. The new de…

We consider a 2-complex in a particular form, called the Quinn model of a 2-complex. It can be sliced in graphs, where a change from one graph to another can be organized by a sequence of local transitions, which are described in a list of F. Quinn [Q1]. The decomposition of that 2-complex into graphs has to be transla…

Study shows $S^1$ algebraic structure in 2-dimensional CW-complex cobordisms.

According to Giroux, contact manifolds can be described as open books whose pages are Stein manifolds. For 5-dimensional contact manifolds the pages are Stein surfaces, which permit a description via Kirby diagrams. We introduce handle moves on such diagrams that do not change the corresponding contact manifold. As an …

We introduce the notion of volume of the representation variety of a finitely presented discrete group in a compact Lie group using the push-forward measure associated to a map defined by a presentation of the discrete group. We show that the volume thus defined is invariant under the Andrews-Curtis moves of the genera…

New methods reveal rare epimorphisms linking 3-manifold groups to free groups.

Study extends geodesic ray transform results to orientable surfaces.

We analyze Darboux transformations in very general settings for multidimensional linear partial differential operators. We consider all known types of Darboux transformations, and present a new type. We obtain a full classification of all operators that admit Wronskian type Darboux transformations of first order and a …

Introduces pseudo-codecomposition of transformation groups.

This paper investigates efficient Transformers and finds they scale with problem size.

The conformal geometry of spacelike surfaces in 4-dimensional Lorentzian space forms has been studied by the authors in a previous paper, where the so-called polar transform was introduced. Here it is shown that this transform preserves spacelike conformal isothermic surfaces. We relate this new transform with the know…

Transformation Equivariant Representations (TERs) aim to capture the intrinsic visual structures that equivary to various transformations by expanding the notion of {\em translation} equivariance underlying the success of Convolutional Neural Networks (CNNs). For this purpose, we present both deterministic AutoEncoding…

Data is said to follow the transform (or analysis) sparsity model if it becomes sparse when acted on by a linear operator called a sparsifying transform. Several algorithms have been designed to learn such a transform directly from data, and data-adaptive sparsifying transforms have demonstrated excellent performance i…

Transforms classical connections using pushforwards and gauge transformations.

Transformers interpret as probabilistic mixtures, offering new insights.

Study normal operators of double fibration transforms with conjugate points.

Transformer-MGK replaces redundant heads with Gaussian key mixtures, improving efficiency and performance.

B-cos transformers explain Vision Transformers' decisions.

Novel power transform unifies various mathematical functions.

Algorithm finds optimal affine transformation to minimize overall distortion.

XR-Transformer accelerates XMC by recursively fine-tuning on multi-resolution objectives.

We study the dynamics of the discrete bicycle (Darboux, Backlund) transformation of polygons in n-dimensional Euclidean space. This transformation is a discretization of the continuous bicycle transformation, recently studied by Foote, Levi, and Tabachnikov. We prove that the respective monodromy is a Moebius transform…

Data augmentation (DA) is fundamental against overfitting in large convolutional neural networks, especially with a limited training dataset. In images, DA is usually based on heuristic transformations, like geometric or color transformations. Instead of using predefined transformations, our work learns data augmentati…

We propose a new class of transforms that we call {\it Lehmer Transform} which is motivated by the {\it Lehmer mean function}. The proposed {\it Lehmer transform} decomposes a function of a sample into their constituting statistical moments. Theoretical properties of the proposed transform are presented. This transform…

Transformers struggle to approximate smooth functions, relying on piecewise constant approximations.

The Weyl transform is introduced as a rich framework for data representation. Transform coefficients are connected to the Walsh-Hadamard transform of multiscale autocorrelations, and different forms of dyadic periodicity in a signal are shown to appear as different features in its Weyl coefficients. The Weyl transform …

We define a transformation on harmonic maps from a Riemann surface into the 2-sphere which depends on a complex parameter, the so-called mu-Darboux transformation. In the case when the harmonic map N is the Gauss map of a constant mean curvature surface f and the parameter is real, the mu-Darboux transformation of -N i…