Results 21 to 30 of about 296 (59)

Simply generated non-crossing partitions [PDF]

open access: yes, 2017
Differs slightly from the published version.International audienceWe introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights.
Kortchemski, Igor, Marzouk, Cyril
core   +2 more sources

Parking Spaces

open access: yes, 2014
Let $W$ be a Weyl group with root lattice $Q$ and Coxeter number $h$. The elements of the finite torus $Q/(h+1)Q$ are called the $W$-{\sf parking functions}, and we call the permutation representation of $W$ on the set of $W$-parking functions the ...
Armstrong, Drew   +2 more
core   +1 more source

Classical and free infinitely divisible distributions and random matrices

open access: yes, 2005
We construct a random matrix model for the bijection \Psi between clas- sical and free infinitely divisible distributions: for every d\geq1, we associate in a quite natural way to each *-infinitely divisible distribution \mu a distribution P_d^{\mu} on ...
Benaych-Georges, Florent
core   +1 more source

Mapping Hsp104 interactions using cross‐linking mass spectrometry

open access: yesFEBS Open Bio, Volume 15, Issue 6, Page 922-939, June 2025.
This study examines how cross‐linking mass spectrometry can be utilized to analyze ATP‐induced conformational changes in Hsp104 and its interactions with substrates. We developed an analytical pipeline to distinguish between intra‐ and inter‐subunit contacts within the hexameric homo‐oligomer and discovered contacts between Hsp104 and a selected ...
Kinga Westphal   +3 more
wiley   +1 more source

The hamburger theorem

open access: yes, 2018
We generalize the ham sandwich theorem to $d+1$ measures in $\mathbb{R}^d$ as follows. Let $\mu_1,\mu_2, \dots, \mu_{d+1}$ be absolutely continuous finite Borel measures on $\mathbb{R}^d$. Let $\omega_i=\mu_i(\mathbb{R}^d)$ for $i\in [d+1]$, $\omega=\min\
Kano, Mikio, Kynčl, Jan
core   +1 more source

Hurwitz numbers for reflection groups III: Uniform formulae

open access: yesJournal of the London Mathematical Society, Volume 111, Issue 3, March 2025.
Abstract We give uniform formulae for the number of full reflection factorizations of a parabolic quasi‐Coxeter element in a Weyl group or complex reflection group, generalizing the formula for the genus‐0 Hurwitz numbers. This paper is the culmination of a series of three.
Theo Douvropoulos   +2 more
wiley   +1 more source

Counting circuit double covers

open access: yesJournal of Graph Theory, Volume 108, Issue 2, Page 374-395, February 2025.
Abstract We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to C k ${C}_{k}$ for some k $k$) instead of cycles (graphs with all degrees even). We give an almost‐exponential lower bound for graphs with a surface embedding of representativity at least 4.
Radek Hušek, Robert Šámal
wiley   +1 more source

Tubings, chord diagrams, and Dyson–Schwinger equations

open access: yesJournal of the London Mathematical Society, Volume 110, Issue 5, November 2024.
Abstract We give series solutions to single insertion place propagator‐type systems of Dyson–Schwinger equations using binary tubings of rooted trees. These solutions are combinatorially transparent in the sense that each tubing has a straightforward contribution.
Paul‐Hermann Balduf   +5 more
wiley   +1 more source

Optimizing multiple equipment scheduling for U‐shaped automated container terminals considering loading and unloading operations

open access: yesComputer-Aided Civil and Infrastructure Engineering, Volume 39, Issue 20, Page 3103-3124, 15 October 2024.
Abstract U‐shaped automated container terminals (ACTs) represent a strategic design in port infrastructure that facilitates simultaneous loading and unloading operations. This paper addresses the challenges of scheduling multiple types of equipment, such as dual trolley quay cranes (DTQCs), automated guided vehicles (AGVs), double cantilever rail ...
Xiang Zhang   +3 more
wiley   +1 more source

The cyclic sieving phenomenon: a survey [PDF]

open access: yes, 2010
The cyclic sieving phenomenon was defined by Reiner, Stanton, and White in a 2004 paper. Let X be a finite set, C be a finite cyclic group acting on X, and f(q) be a polynomial in q with nonnegative integer coefficients.
Sagan, Bruce E.
core   +3 more sources

Home - About - Disclaimer - Privacy