English
Related papers

Related papers: BLINK: a language to view, recognize, classify and…

200 papers

Refraction, interference, and diffraction serve as distinguishing features for wave-like phenomena. While they are normally associated only with a purely spatial wave-propagation pattern, analogs to interference and diffraction involving…

Quantum Physics · Physics 2011-05-17 M. Jaaskelainen , M. Lombard , U. Zuelicke

In this paper we study the relation between two diagrammatic representations of links in lens spaces: the disk diagram and the grid diagram and we find how to pass from one to the other. We also investigate whether the HOMFLY-PT invariant…

Geometric Topology · Mathematics 2013-12-10 Alessia Cattabriga , Enrico Manfredi , Lorenzo Rigolli

This paper presents some basic facts about the so-called connectivity spaces. In particular, it studies the generation of connectivity structures, the existence of limits and colimits in the main categories of connectivity spaces, the…

General Topology · Mathematics 2011-02-02 Stéphane Dugowson

The notion of a Bing cell is introduced, and it is used to define invariants, link groups, of 4-manifolds. Bing cells combine some features of both surfaces and 4-dimensional handlebodies, and the link group \lambda(M) measures certain…

Geometric Topology · Mathematics 2014-09-30 Vyacheslav Krushkal

From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link…

Category Theory · Mathematics 2026-02-25 Rita Fioresi , Angelica Simonetti , Ferdinando Zanchetta

We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the…

Combinatorics · Mathematics 2009-09-29 V. Ejov , N. Pugacheva , S. Rossomakhine , P. Zograf

A descriptive approach for automatic generation of visual blends is presented. The implemented system, the Blender, is composed of two components: the Mapper and the Visual Blender. The approach uses structured visual representations along…

Artificial Intelligence · Computer Science 2019-02-20 João M. Cunha , João Gonçalves , Pedro Martins , Penousal Machado , Amílcar Cardoso

A new filtration of the spaces of tri-/univalent graphs B_m^u that occur in the theory of finite-type invariants of knots and 3-manifolds is introduced. Combining the results of the two preceding articles, the quotients of this filtration…

Quantum Algebra · Mathematics 2009-09-29 Jan Kneissler

We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…

Artificial Intelligence · Computer Science 2018-04-11 Daniel J. Buehrer

We assume that the points in volumes smaller than an elementary volume (which may have a Planck size) are indistinguishable in any physical experiment. This naturally leads to a picture of a discrete space with a finite number of degrees of…

High Energy Physics - Theory · Physics 2026-01-07 Ali H. Chamseddine , Viatcheslav Mukhanov

For a closed 4-manifold X and closed 3-manifold M we investigate the smallest integer n (perhaps infinity) such that M embeds in the connected sum of n copies of X. It is proven that any lens space (or homology lens space) embeds…

Geometric Topology · Mathematics 2007-05-23 Allan L. Edmonds

We exhibit several families of planar graphs that are minor-minimal intrinsically spherical $3$-linked. A graph is intrinsically spherical 3-linked if it is planar graph that has, in every spherical embedding, a non-split 3-link consisting…

Combinatorics · Mathematics 2021-07-20 Madeleine Burkhart , Andrew Castillo , Jonathan Doane , Joel Foisy , Cristopher Negron

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

General Topology · Mathematics 2011-10-28 Agelos Georgakopoulos

We consider the moduli spaces $\mathcal{M}_d(\ell)$ of a closed linkage with n links and prescribed lengths in d-dimensional Euclidean space. For d>3 these spaces are no longer manifolds generically, but they have the structure of a…

Algebraic Topology · Mathematics 2013-06-20 Dirk Schuetz

For some research questions that involve Spin(p, q) representation theory, using symbolic algebra based techniques might be an attractive option for simplifying and manipulating expressions. Yet, for some such problems, especially as they…

High Energy Physics - Theory · Physics 2023-05-10 Thomas Fischbacher

The dynamics in three-dimensional billiards leads, using a Poincar\'e section, to a four-dimensional map which is challenging to visualize. By means of the recently introduced 3D phase-space slices an intuitive representation of the…

Chaotic Dynamics · Physics 2018-08-27 Markus Firmbach , Steffen Lange , Roland Ketzmerick , Arnd Bäcker

Triple linking numbers were defined for 3-component oriented surface-links in 4-space using signed triple points on projections in 3-space. In this paper we give an algebraic formulation using intersections of homology classes (or cup…

Geometric Topology · Mathematics 2007-05-23 J. Scott Carter , Seiichi Kamada , Masahico Saito , Shin Satoh

A divide is the image of a proper and generic immersion of a compact $1$-manifold into the $2$-disk. Due to A'Campo's theory, each divide is associated with a link in the 3-sphere. In this paper, we reveal a hidden hyperbolic structure in…

Geometric Topology · Mathematics 2024-02-27 Ryoga Furutani , Yuya Koda

State-space reduction techniques, used primarily in model-checkers, all rely on the idea that some actions are independent, hence could be taken in any (respective) order while put in parallel, without changing the semantics. It is thus not…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-04-03 Lisbeth Fajstrup , Eric Goubault , Emmanuel Haucourt , Samuel Mimram , Martin Raussen

We pose 3D scene-understanding as a problem of parsing in a grammar. A grammar helps us capture the compositional structure of real-word objects, e.g., a chair is composed of a seat, a back-rest and some legs. Having multiple rules for an…

Computer Vision and Pattern Recognition · Computer Science 2012-11-09 Abhishek Anand , Sherwin Li
‹ Prev 1 4 5 6 7 8 10 Next ›