Results 131 to 140 of about 113,961 (276)
Local multiplicativity of perverse filtrations
Abstract Let f:S→C$f:S\rightarrow C$ be a proper surjective morphism from a smooth Kähler surface to a smooth curve. We show that the local perverse filtration associated with the induced map S[n]→C(n)$S^{[n]}\rightarrow C^{(n)}$ is multiplicative on each fiber if and only if f$f$ is an elliptic fibration.
Zili Zhang
wiley +1 more source
Context‐free graphs and their transition groups
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
1945 Annual Meeting Report of the American Folklore Society [PDF]
Originally published in the Journal of American Folklore, volume 59, issue 232, pages 189 ...
American Folklore Society
core
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
ABSTRACT A (2‐dimensional) realisation of a graph G is a pair ( G , p ), where p maps the vertices of G to R 2. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We say that G is rigid if every generic realisation of G is rigid; otherwise, G is flexible. In this paper, we investigate
Katie Clinch +5 more
wiley +1 more source
1964 Program for the Joint Meeting of the American Folklore Society, the North Carolina Folklore Society, the Duke University Press, and the Graduate English Club [PDF]
This document is the conference program for the joint meeting of the American Folklore Society, the North Carolina Folklore Society, the Duke University Press, and the Graduate English Club held on the campus of Duke University in Durham, NC on April 23 ...
American Folklore Society
core
On the Hardness of Switching to a Small Number of Edges
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
1896 Annual Meeting Report of the American Folklore Society [PDF]
Originally published in the Journal of American Folklore, volume 10, number 36, pages 55 ...
American Folklore Society
core
Bounded diameter monochromatic component covers
Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley +1 more source
How to pick your football team
Abstract Team captains Alice and Bob divide up 2m$2m$ footballers, each reduced to a real‐valued score, into two teams of m$m$ footballers each. On each turn, one captain plays picker, and the other chooser: the picker names a footballer yet to be selected, and the chooser decides which captain's team receives that footballer.
Bhargav Narayanan
wiley +1 more source

