Results 71 to 80 of about 3,028 (216)
On the local Kan structure and differentiation of simplicial manifolds
Bulletin of the London Mathematical Society, EarlyView.Abstract We prove that arbitrary simplicial manifolds satisfy Kan conditions in a suitable local sense. This allows us to expand a technique for differentiating higher Lie groupoids worked out in [8] to the setting of general simplicial manifolds. Consequently, we derive a method to differentiate simplicial manifolds into higher Lie algebroids.
Florian Dorsch
wiley +1 more source
Resources for Research on Analogy: A Multi-disciplinary Guide
Informal 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
On computing local monodromy and the numerical local irreducible decomposition
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
Bijections for Dyck paths with colored hills [PDF]
Enumerative Combinatorics and Applications, 2022 Kostas Manes, Ioannis Tasoulas
doaj +1 more source
Dyck tilings, linear extensions, descents, and inversions [PDF]
Discrete 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
International Transactions in Operational Research, Volume 33, Issue 3, Page 1525-1558, May 2026.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
Type C parking functions and a zeta map [PDF]
Discrete 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
An allocation rule for connection scheduling problems
International Transactions in Operational Research, Volume 33, Issue 2, Page 892-925, March 2026.Abstract This paper studies so‐called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a
Laura Davila‐Pena +3 more
wiley +1 more source
Algebraic properties for some permutation statistics [PDF]
Discrete 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
The ∞$\infty$‐categorical reflection theorem and applications
Journal 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