Results 71 to 80 of about 116,873 (193)

Resources for Research on Analogy: A Multi-disciplinary Guide

open access: yesInformal Logic, 2009
Work on analogy has been done from a number of disciplinary perspectives throughout the history of Western thought. This work is a multidisciplinary guide to theorizing about analogy.
Marcello Guarini   +3 more
doaj   +1 more source

Dyck tilings, linear extensions, descents, and inversions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths.
Jang Soo Kim   +3 more
doaj   +1 more source

Clique trees of infinite locally finite chordal graphs [PDF]

open access: yes, 2018
We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees.
Hofer-Temmel, Christoph, Lehner, Florian
core   +1 more source

Local equivalence and refinements of Rasmussen's s‐invariant

open access: yesJournal of Topology, Volume 19, Issue 1, March 2026.
Abstract Inspired by the notions of local equivalence in monopole and Heegaard Floer homology, we introduce a version of local equivalence that combines odd Khovanov homology with equivariant even Khovanov homology into an algebraic package called a local even–odd (LEO) triple.
Nathan M. Dunfield   +2 more
wiley   +1 more source

Type C parking functions and a zeta map [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
We introduce type $C$ parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type $C$ parking functions to regions of the Shi arrangement of type $C$, encoded as diagonally labelled ...
Robin Sulzgruber, Marko Thiel
doaj   +1 more source

The ∞$\infty$‐categorical reflection theorem and applications

open access: yesJournal of Topology, Volume 19, Issue 1, March 2026.
Abstract We prove an ∞$\infty$‐categorical version of the reflection theorem of AdÁmek and Rosický [Arch. Math. 25 (1989), no. 1, 89–94]. Namely, that a full subcategory of a presentable ∞$\infty$‐category that is closed under limits and κ$\kappa$‐filtered colimits is a presentable ∞$\infty$‐category.
Shaul Ragimov, Tomer M. Schlank
wiley   +1 more source

Algebraic properties for some permutation statistics [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
In this article, we study some quotient sets on permutations built from peaks, valleys, double rises and double descents. One part is dedicated to the enumeration of the cosets using the bijection of Francon-Viennot which is a bijection between ...
Vincent Vong
doaj   +1 more source

How Far Are Two Symmetric Matrices From Commuting? With an Application to Object Characterisation and Identification in Metal Detection

open access: yesMathematical Methods in the Applied Sciences, Volume 49, Issue 3, Page 1914-1942, February 2026.
ABSTRACT Examining the extent to which measurements of rotation matrices are close to each other is challenging due measurement noise. To overcome this, data is typically smoothed, and the Riemannian and Euclidean metrics are applied. However, if rotation matrices are not directly measured and are instead formed by eigenvectors of measured symmetric ...
P. D. Ledger   +2 more
wiley   +1 more source

Bijections and homomorphisms

open access: yesSemigroup Forum, 1984
Conditions on a map \(f:L\to M\) from a lattice L to a lattice M are considered under which f is a homomorphism of lattices in the case when f is a bijection. The main result of the paper is the following Theorem 4. Let L and M be lattices and let f:\(L\to M\) be a bijection.
Johnson, J., Moss, K.
openaire   +1 more source

Robust estimation of a Markov chain transition matrix from multiple sample paths

open access: yesStatistica Neerlandica, Volume 80, Issue 1, February 2026.
Markov chains are fundamental models for stochastic dynamics, with applications in a wide range of areas such as population dynamics, queueing systems, reinforcement learning, and Monte Carlo methods. Estimating the transition matrix and stationary distribution from observed sample paths is a core statistical challenge, particularly when multiple ...
Lasse Leskelä, Maximilien Dreveton
wiley   +1 more source

Home - About - Disclaimer - Privacy