arXiv research

Synthesizing high-quality images from text descriptions is a challenging problem in computer vision and has many practical applications. Samples generated by existing text-to-image approaches can roughly reflect the meaning of the given descriptions, but they fail to contain necessary details and vivid object parts. In…

Unified geometric description of Kepler flow across all energies.

The twisted face-pairing construction of our earlier papers gives an efficient way of generating, mechanically and with little effort, myriads of relatively simple face-pairing descriptions of interesting closed 3-manifolds. The corresponding description in terms of surgery, or Dehn-filling, reveals the twist construct…

Describes links between Finsler and Lorentz geometries for Riemannian geometers.

Advocates for user-friendly RL problem descriptions to improve usability and generalization.

Solves problem of describing transformations for upper triangular Toeplitz operators.

The jet bundle description of time-dependent mechanics is revisited. The constraint algorithm for singular Lagrangians is discussed and an exhaustive description of the constraint functions is given. By means of auxiliary connections we give a basis of constraint functions in the Lagrangian and Hamiltonian sides. An ad…

In this paper we use tools from differential topology to give a geometric description of cohomology for Hilbert manifolds. Our model is Quillen's geometric description of cobordism groups for finite dimensional smooth manifolds \cite{Q}. Quillen stresses the fact that this construction allows the definition of Gysin ma…

It is proved that the set of geodesic circles in two dimensions may be given a variational description and the explicit form of it is presented. In the limit case of the Euclidean geometry a certain claim of uniqueness of such description is proved. A formal notion of 'spin' force is discovered as a by-product of the v…

This paper creates a tagging system for paintings using historical descriptions.

This paper studies fixed sets in ribbon complexes using descriptive proximity spaces.

We treat the vakonomic dynamics with general constraints within a new geometric framework which will be appropriate to study optimal control problems. We compare our formulation with Vershik-Gershkovich one in the case of linear constraints. We show how nonholonomic mechanics also admits a new geometrical description w…

New method compares community detection algorithms without ground truth.

Anomaly detection has numerous applications and has been studied vastly. We consider a complementary problem that has a much sparser literature: anomaly description. Interpretation of anomalies is crucial for practitioners for sense-making, troubleshooting, and planning actions. To this end, we present a new approach c…

Recommender systems relying on latent factor models often appear as black boxes to their users. Semantic descriptions for the factors might help to mitigate this problem. Achieving this automatically is, however, a non-straightforward task due to the models' statistical nature. We present an output-agreement game that …

Following on from ``Hyperbolic Plateau problems'' (by the same author), we provide a complete geometric description of solutions to the Plateau problem $(S,φ)$ when $S$ is a compact Riemann surface with a finite number of points removed.

Using Kirby Calculus, we explicitly pass from Berge's R-R descriptions of ten families of knots with lens space surgeries to surgery descriptions on the minimally twisted five chain link (MT5C). Since the MT5C admits a strong involution, we also give the corresponding tangle descriptions.

In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been v…

Several new combinatorial descriptions of closed 4-manifolds have recently been introduced in the study of smooth maps from 4-manifolds to surfaces. These descriptions consist of simple closed curves in a closed, orientable surface and these curves appear as so called vanishing sets of corresponding maps. In the presen…

Using methods of descriptive theory it is shown that the classification problem for wild knots is strictly harder than that for countable structures.

New method improves bivariate causal discovery by accurately estimating cause variable complexity.

Using properties of the determinant line bundle for a family of elliptic boundary value problems, we explain how the Fock space functor defines an axiomatic quantum field theory which formally models the Fermionic path integral. The 'sewing axiom' of the theory arises as an algebraic pasting law for the determinant of …

Probabilistic programming languages represent complex data with intermingled models in a few lines of code. Efficient inference algorithms in probabilistic programming languages make possible to build unified frameworks to compute interesting probabilities of various large, real-world problems. When the structure of mo…

BERT learns claim descriptions to identify patent novelty.

This note is purely expository. In the course of the Kolmogorov-Arnold solution of Hilbert's 13th problem on superpositions there appeared the notion of basic embedding. A subset K of R^2 is basic if for each continuous function f:K->R there exist continuous functions g,h:R->R such that f(x,y)=g(x)+h(y) for each point …

Minimum Description Length prevents overfitting in noisy data.

Tensor approach simplifies Euclidean space descriptions.

Collaborative filtering is used to recommend items to a user without requiring a knowledge of the item itself and tends to outperform other techniques. However, collaborative filtering suffers from the cold-start problem, which occurs when an item has not yet been rated or a user has not rated any items. Incorporating …

Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of these vertices, thus opening the way for substantial optimization. Here we give an…

Classifies manifolds and discrete subgroups of Lie groups using descriptive set theory.

Based on ideas of W. M. Tulczyjew, a geometric framework for a frame-independent formulation of different problems in analytical mechanics is developed. In this approach affine bundles replace vector bundles of the standard description and functions are replaced by sections of certain affine line bundles called AV-bund…

Support Vector Data Description (SVDD) is a popular outlier detection technique which constructs a flexible description of the input data. SVDD computation time is high for large training datasets which limits its use in big-data process-monitoring applications. We propose a new iterative sampling-based method for SVDD…

By obtaining surgery descriptions of knots which lie on the genus one fiber of the trefoil or figure eight knot, we show that these include hyperbolic knots with arbitrarily large volume. These knots admit lens space surgeries and form two families of Berge knots. By way of tangle descriptions we also obtain surgery de…

Unique surgery descriptions found for knots in 3-manifolds.

PCA (Principal Component Analysis) and its variants areubiquitous techniques for matrix dimension reduction and reduced-dimensionlatent-factor extraction. One significant challenge in using PCA, is thechoice of the number of principal components. The information-theoreticMDL (Minimum Description Length) principle gives…

We present a detailed description of a fundamental group algorithm based on Forman's combinatorial version of Morse theory. We use this algorithm in a classification problem of prime knots up to 14 crossings.

An intrinsic description of the Hamilton-Cartan formalism for first-order Berezinian variational problems determined by a submersion of supermanifolds is given. This is achieved by studying the associated higher-order graded variational problem through the Poincaré-Cartan form. Noether theorem and examples from superfi…

Complete description of flat Lorentzian Lie groups solved.

We describe the range of a restricted spherical mean transform, which sends a function supported inside a closed ball in a hyperbolic space to its mean values on the geodesics spheres centered at the boundary of the ball. The description resembles that of the same transform on the Euclidean spaces obtained by Mark Agra…

Chart descriptions are a graphic method to describe monodromy representations of various topological objects. Here we introduce a chart description for hyperelliptic Lefschetz fibrations, and show that any hyperelliptic Lefschetz fibration can be stabilized by fiber-sum with certain basic Lefschetz fibrations.

We present a systematic study of symmetries, invariants and moduli spaces of classes of coframes. We introduce a classifying Lie algebroid to give a complete description of the solution to Cartan's realization problem that applies to both the local and the global versions of this problem.

This paper proposes a system-agnostic policy for dynamic scheduling.

Study natural invariants for differential operators, simplifying their equivalence problem.

In this work we investigate the following isoperimetric problem in the hyperbolic plane: to find the regions of prescribed area with minimal perimeter between two parallel horocycles. We give an explicit and detailed description of all such regions.

We address the problem of learning human-interpretable descriptions of a complex system from a finite set of positive and negative examples of its behavior. In contrast to most of the recent work in this area, which focuses on descriptions expressed in Linear Temporal Logic (LTL), we develop a learning algorithm for fo…

The Turaev cobracket, a loop operation introduced by V. Turaev, which measures self-intersection of a loop on a surface, is a modification of a path operation introduced earlier by Turaev himself, as well as a counterpart of the Goldman bracket. In this survey based on the author's joint works with A. Alekseev, Y. Kuno…

Chart descriptions are a graphic method to describe monodromy representations of various topological objects. Here we introduce a chart description for genus-two Lefschetz fibrations, and show that any genus-two Lefschetz fibration can be stabilized by fiber-sum with certain basic Lefschetz fibrations.

We show that isothermic surfaces and S-Willmore surfaces are also the solutions to the corresponding Blaschke's problem for both spacelike and timelike surfaces in pseudo-Riemannian space forms. For timelike surfaces both Willmore and isothermic, we obtain a description by minimal surfaces similar to the classical resu…