English
Related papers

Related papers: Graceful labellings of variable windmills using Sk…

200 papers

Visual knowledge bases such as Visual Genome power numerous applications in computer vision, including visual question answering and captioning, but suffer from sparse, incomplete relationships. All scene graph models to date are limited to…

Computer Vision and Pattern Recognition · Computer Science 2019-12-03 Vincent S. Chen , Paroma Varma , Ranjay Krishna , Michael Bernstein , Christopher Re , Li Fei-Fei

We prove the a.e. nonamenability of locally finite quasi-pmp Borel graphs whose every component admits at least three nonvanishing ends with respect to the underlying Radon--Nikodym cocycle. We witness their nonamenability by constructing…

Dynamical Systems · Mathematics 2025-12-30 Ruiyuan Chen , Grigory Terlov , Anush Tserunyan

We enumerate smooth and rationally smooth Schubert varieties in the classical finite types A, B, C, and D, extending Haiman's enumeration for type A. To do this enumeration, we introduce a notion of staircase diagrams on a graph. These…

Combinatorics · Mathematics 2018-08-20 Edward Richmond , William Slofstra

We classify, up to derived (equivalently, tilting-cotilting) equivalence all nondegenerate gentle two-cycle algebras. We also give a partial classification and formulate a conjecture in the degenerate case.

Representation Theory · Mathematics 2007-10-23 Grzegorz Bobinski , Piotr Malicki

We prove that, if $\Gamma$ is a finite connected $3$-valent vertex-transitive, or $4$-valent vertex- and edge-transitive graph, then either $\Gamma$ is part of a well-understood family of graphs, or every non-identity automorphism of…

Combinatorics · Mathematics 2024-12-20 Marco Barbieri , Valentina Grazian , Pablo Spiga

Let $a$ and $b$ be positive integers with prime factorisations $a = p_1^np_2^n$ and $b = q_1^nq_2^n$. We prove that the number of essentially distinct $\alpha$-graceful labelings of the complete bipartite graph $K_{a, b}$ equals the…

Combinatorics · Mathematics 2023-08-24 Nikolai Beluhov

To a pair $(A,s)$ consisting of a smooth, cyclic $A_\infty$-algebra $A$ and a splitting $s$ of the Hodge filtration on its Hochschild homology Costello (2005) associates an invariant which conjecturally generalizes the total descendant…

Symplectic Geometry · Mathematics 2025-03-12 Andrei Caldararu , Junwu Tu

A good edge-labeling of a graph [Ara\'ujo, Cohen, Giroire, Havet, Discrete Appl. Math., forthcoming] is an assignment of numbers to the edges such that for no pair of vertices, there exist two non-decreasing paths. In this paper, we study…

Combinatorics · Mathematics 2012-07-30 Michel Bode , Babak Farzad , Dirk Oliver Theis

In this paper, we introduce a C*-algebra associated to any substitution (via its Bratteli diagram model). We show that this C*-algebra contains the partial crossed product C*-algebra of the corresponding Bratteli-Vershik system and show…

Operator Algebras · Mathematics 2011-08-24 Daniel Gonçalves , Danilo Royer

For a graph $G$ and an abelian group $A$, a labeling of the vertices of $G$ induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an $A$-cordial vertex labeling when both the vertex and edge…

We show that diffraction features of $1D$ quasicrystals can be retrieved from a single topological quantity, the \v{C}ech cohomology group, $\check{H}^{1}\cong\mathbb{Z}^2$, which encodes all relevant combinatorial information of tilings.…

Other Condensed Matter · Physics 2021-10-19 Yaroslav Don , Eric Akkermans

For a compact surface $S = S_{g,n}$ with $3g + n \geq 4$, we introduce a family of unitary representations of the mapping class group Mod($S$) based on the space of measured foliations. For this family of representations, we show that none…

Geometric Topology · Mathematics 2021-03-02 Biao Ma

A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…

Combinatorics · Mathematics 2021-11-09 Emily Eckels , Ervin Gyori , Junsheng Liu , Sohaib Nasir

An $L(2,1)$-labeling of a graph $G=(V,E)$ is a function $f$ from the vertex set $V(G)$ to the set of nonnegative integers such that the labels on adjacent vertices differ by at least two, and the labels on vertices at distance two differ by…

Combinatorics · Mathematics 2024-12-02 Irena Hrastnik Ladinek

In this short note we construct unbounded families of minimal surfaces of general type with canonical map of degree 4 such that the limits of the slopes assume countably many different values among 6+2/3 and 8.

Algebraic Geometry · Mathematics 2023-05-23 Federico Fallucca , Roberto Pignatelli

In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…

Combinatorics · Mathematics 2025-11-06 Yandong Bai , Andrzej Grzesik , Binlong Li , Magdalena Prorok

If E is a C^\infty complex vector bundle on an oriented C^\infty manifold \Sigma, diffeomorphic to a circle, then the space of sections of E has a canonical polarization in the sense of Pressley and Segal and so one has its determinantal…

Differential Geometry · Mathematics 2007-05-23 P. Bressler , M. Kapranov , B. Tsygan , E. Vasserot

We provide a classification of globally generated vector bundles with $c_1 = 5$ on the projective 3-space. The classification is complete (except for one case) but not as detailed as the corresponding classification in the case $c_1 = 4$…

Algebraic Geometry · Mathematics 2018-05-30 Cristian Anghel , Iustin Coanda , Nicolae Manolache

There are many classes of nonsimple graph C*-algebras that are classified by the six-term exact sequence in K-theory. In this paper we consider the range of this invariant and determine which cyclic six-term exact sequences can be obtained…

Operator Algebras · Mathematics 2015-10-30 Søren Eilers , Takeshi Katsura , Mark Tomforde , James West

An $L(d,1)$-labeling of a graph $G$ is an assignment of nonnegative integers to the vertices such that adjacent vertices receive labels that differ by at least $d$ and those at a distance of two receive labels that differ by at least one,…

Combinatorics · Mathematics 2024-09-04 Irena Hrastnik Ladinek