Results 61 to 70 of about 3,063 (228)

On Sillke's bijection

open access: yesTheoretical Computer Science, 2017
Indecomposable permutations in S n + 1 , subgroups of index n of the free group on two generators and doubly pointed hypermaps of cardinality n are equinumerous. We give here a proof of a bijection, due to Sillke, between these three sets.
Robert Cori, Christophe Reutenauer
openaire   +2 more sources

On the section conjecture over fields of finite type

open access: yesMathematische Nachrichten, EarlyView.
Abstract Assume that the section conjecture holds over number fields. We prove then that it holds for a broad class of curves defined over finitely generated extensions of Q$\mathbb {Q}$. This class contains every projective, hyperelliptic curve, every hyperbolic, affine curve of genus ≤2$\le 2$, and a basis of open subsets of any curve.
Giulio Bresciani
wiley   +1 more source

A bijection between shrubs and series-parallel posets [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
Motivated by the theory of operads, we introduce new combinatorial objects, called shrubs, that generalize forests of rooted trees. We show that the species of shrubs is isomorphic to the species of series-parallel posets.
Frédéric Chapoton
doaj   +1 more source

Bijections for Entringer families

open access: yesEuropean Journal of Combinatorics, 2011
19 ...
Gelineau, Yoann   +2 more
openaire   +3 more sources

Relational Bundle Geometric Formulation of Non‐Relativistic Quantum Mechanics

open access: yesFortschritte der Physik, EarlyView.
Abstract A bundle geometric formulation of non‐relativistic many‐particles Quantum Mechanics is presented. A wave function is seen to be a C$\mathbb {C}$‐valued cocyclic tensorial 0‐form on configuration space‐time seen as a principal bundle, while the Schrödinger equation flows from its covariant derivative, with the action functional supplying a ...
J. T. François, L. Ravera
wiley   +1 more source

Computing the bridge length: the key ingredient in a continuous isometry classification of periodic point sets

open access: yesActa Crystallographica Section A, EarlyView.
We describe an efficient algorithm to compute the bridge length estimating the size of a complete isoset invariant, which classifies all periodic point sets under Euclidean motion.The fundamental model of any periodic crystal is a periodic set of points at all atomic centres.
Jonathan McManus, Vitaliy Kurlin
wiley   +1 more source

A Bijection for Enriched Trees

open access: yesEuropean Journal of Combinatorics, 1994
The author establishes a bijection involving species of enriched trees that leads to a combinatorial proof of Lagrange's inversion formula.
openaire   +3 more sources

Bijective preimages of ω1

open access: yesTopology and its Applications, 1997
AbstractWe study the structure of spaces admitting a continuous bijection to the space of all countable ordinals with its usual order topology. We relate regularity, zero-dimensionality and pseudonormality. We examine the effect of covering properties and ω1-compactness and show that locally compact examples have a particularly nice structure assuming ...
Chris Good, Chris Good
openaire   +2 more sources

Modeling and generating user‐centered contrastive explanations for the workforce scheduling and routing problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge   +3 more
wiley   +1 more source

Bijections for partition identities

open access: yesJournal of Combinatorial Theory, Series A, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Home - About - Disclaimer - Privacy