arXiv research

Paper introduces skew-symmetric matrices for virtual doodle classification.

Paper defines doodles on closed surfaces, unifying classical and virtual theories.

A virtual doodle is an equivalence class of virtual diagrams under an equivalence relation generated by flat version of classical Reidemesiter moves and virtual Reidemsiter moves such that Reidemeister moves of type 3 are forbidden. In this paper we discuss colorings of virtual diagrams using an algebra, called a doodl…

In 1997 M.~Khovanov proved that any doodle can be presented as closure of twin, this result is analogue of classical Alexander's theorem for braids and links. We give a description of twins that have equivalent closures, this theorem is analogue of classical Markov theorem.

Classifies doodles into prime and super prime types, describing them with doodle codes.

Alexander invariant created for doodles, vanishes on unlinked doodles.

Doodles were introduced in [R. Fenn and P. Taylor, Introducing doodles, Topology of low-dimensional manifolds, pp. 37--43, Lecture Notes in Math., 722, Springer, Berlin, 1979] but were restricted to embedded circles in the 2-sphere. Khovanov, [M. Khovanov, Doodle groups, Trans. Amer. Math. Soc. 349 (1997), 2297--2315],…

Doodles link to commutator identities in a 2-sphere.

Complete invariant defined for doodles on a sphere.

We discuss Gauss codes of virtual diagrams and virtual doodles. The notion of a left canonical Gauss code is introduced and it is shown that oriented virtual doodles are uniquely presented by left canonical Gauss codes.

Cactus doodles are geometric objects derived from cactus groups.

Paper shows how to represent Milnor's triple linking number using chord diagrams and doodle invariants.

Proves Alexander and Markov theorems for higher genus virtual doodles.

Computes invariants distinguishing between immersions and embeddings of doodles and blobs on surfaces.

DOODL learns shared spectral dynamics across related dynamical systems.

To make music composition more approachable, we designed the first AI-powered Google Doodle, the Bach Doodle, where users can create their own melody and have it harmonized by a machine learning model Coconet (Huang et al., 2017) in the style of Bach. For users to input melodies, we designed a simplified sheet-music ba…

The paper classifies 10 antipodal pairings of self-dual maps.

Given a plane curve $γ: S^1\to \mathbb R^2$, we consider the problem of determining the minimal number $I(γ)$ of inflections which curves $\mbox{diff}(γ)$ may have, where $\mbox{diff}$ runs over the group of diffeomorphisms of $\mathbb R^2$. We show that if $γ$ is an immersed curve with $D(γ)$ double points and no othe…

We investigate using reinforcement learning agents as generative models of images (extending arXiv:1804.01118). A generative agent controls a simulated painting environment, and is trained with rewards provided by a discriminator network simultaneously trained to assess the realism of the agent's samples, either uncond…

This paper explores Brunnian twin groups and their properties.

This paper asks, "Do classics exist in megaproject management?" We identify three types of classic texts: conventional, Kuhnian, and citation classics. We find that the answer to our question depends on the definition of "classic" employed. First, "citation classics" do exist in megaproject management, and they perform…

We show that any virtual or welded period of a classical knot $K$ can be realized as a classical period. A direct consequence is that a classical knot admits only finitely many virtual or welded periods.

Classical knot recognition problem solved in NP with exponential time algorithm.

Classical scaling is shown to be optimal under various noisy conditions.

This paper compares classical shadows and direct quantum measurement for efficient information extraction.

Quantum oracles help identify counterfactuals better than classical ones.

Classical clients can verify quantum learning tasks efficiently.

Study on non-classical generating sets in Fuchsian Schottky groups.

Survey of various non-classical knot theories from geometric and algebraic perspectives.

Study compares quantum and classical ML in crypto trading, finding hybrid models outperform.

This work shows how to efficiently simulate parts of quantum landscapes using classical computers.

Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.

The paper studies how geometric transformations affect semi-classical operators on specific Lie groups.

We construct various functorial maps (projections) from virtual knots to classical knots. These maps are defined on diagrams of virtual knots; in terms of Gauss diagram each of them can be represented as a deletion of some chords. The construction relies upon the notion of parity. As corollaries, we prove that the mini…

Generalizes meander diagrams to virtual knots and introduces new invariants.

Not all Schottky groups of Moebius transformations are classical Schottky groups. In this paper we show that all Fuchsian Schottky groups are classical Schottky groups, but not necessarily on the same set of generators.

A classical link in 3-space can be represented by a Gauss paragraph encoding a link diagram in a combinatorial way. A Gauss paragraph may code not a classical link diagram, but a diagram with virtual crossings. We present a criterion and a linear algorithm detecting whether a Gauss paragraph encodes a classical link. W…

Using a supergeometric interpretation of field functionals, we show that for a class of classical field models used for realistic quantum field theoretic models, an infinite-dimensional supermanifold (smf) of classical solutions in Minkowski space can be constructed. That is, we show that the smf of smooth Cauchy data …

A graphical calculus for microformal morphisms simplifies complex operations in classical and quantum physics.

This work proposes efficient classical training protocols for IQP circuits to train quantum generative models.

We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms and knots.

Quantum computers outperform classical methods in density modeling.

In the present paper, we consider local moves on classical and welded diagrams: (self-)crossing change, (self-)virtualization, virtual conjugation, Delta, fused, band-pass and welded band-pass moves. Interrelationship between these moves is discussed and, for each of these move, we provide an algebraic classification. …

We prove an upper bound for the evaluation of all classical SU(2) spin networks conjectured by Garoufalidis and van der Veen. This implies one half of the analogue of the volume conjecture which they proposed for classical spin networks. We are also able to obtain the other half, namely, an exact determination of the s…

We introduce the multiplexing of a crossing, replacing a classical crossing of a virtual link diagram with multiple crossings which is a mixture of classical and virtual. For integers $m_{i}$ $(i=1,\ldots,n)$ and an ordered $n$-component virtual link diagram $D$, a new virtual link diagram $D(m_{1},\ldots,m_{n})$ is ob…

Non-classical virtual knots may have non-isomorphic upper and lower quandles. We exploit this property to define the quandle difference invariant, which can detect non-classicality by comparing the numbers of homomorphisms into a finite quandle from a virtual knot's upper and lower quandles. The invariants for small-or…

Diffeologies unify infinite-dimensional geometry and PDEs, enhancing classical function spaces.

Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a smaller transmission rate. Here, we examine this procedure when the intermediate…