相关论文: Cobounding odd cycle colorings

We construct orbifolds with quasitoric boundary and show that they have stable almost complex structure. We show that a quasitoric orbifold is complex cobordant to finite disjoint copies of complex orbifold projective spaces. Finally some…

Generalizing the notion of odd-sum colorings, a $\mathbb{Z}$-labeling of a graph $G$ is called a closed coloring with remainder $k\mod n$ if the closed neighborhood label sum of each vertex is congruent to $k\mod n$. If such colorings…

We prove that every graph with circumference at most $k$ is $O(\log k)$-colourable such that every monochromatic component has size at most $O(k)$. The $O(\log k)$ bound on the number of colours is best possible, even in the setting of…

Kucerovsky's theorem provides a method for recognizing the interior Kasparov product of selfadjoint unbounded cycles. In this paper we extend Kucerovsky's theorem to the non-selfadjoint setting by replacing unbounded Kasparov modules with…

We provide a systematic test of empirical theories of covalent bonding in solids using an exact procedure to invert ab initio cohesive energy curves. By considering multiple structures of the same material, it is possible for the first time…

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objects which allows the sampling of size-colored…

Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.

K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…

Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…

We consider the problem of extending partial edge colorings of iterated cartesian products of even cycles and paths, focusing on the case when the precolored edges satisfy either an Evans-type condition or is a matching. In particular, we…

By Lovasz' proof of the Kneser conjecture, the chromatic number of a graph G is bounded from below by the index of the Z_2-space Hom(K_2,G) plus two. We show that the cohomological index of Hom(K_2,G) is also greater than the cohomological…

We show that colored Khovanov homology detects classes of essential surfaces as a direct analogue of the slope conjectures for the colored Jones polynomial. We do this by identifying certain generators of the colored Khovanov chain complex…

We prove a uniqueness result for limit cycles of a class of second order ODE's. As a special case, we prove limit cycle's uniqueness for an ODE studied in \cite{ETBA}.

A colored Gaussian graphical model is a linear concentration model in which equalities among the concentrations are specified by a coloring of an underlying graph. Marigliano and Davies conjectured that every linear binomial that appears in…

We construct a limit aperiodic coloring of hyperbolic groups. Also we construct limit strongly aperiodic strictly balanced tilings of the Davis complex for all Coxeter groups.

We confirm the quasi-projective case of Saito's conjecture, namely that the cohomological characteristic classes defined by Abbes and Saito can be computed in terms of the characteristic cycles. We construct a cohomological characteristic…

Vogan and Barbasch-Vogan attach two similar invariants to representations of a reductive Lie group, one by an algebraic process, the other analytic. They conjectured that the two invariants determine each other in a definite manner. Here we…

We define "paradoxical colouring rule", show its relation to measure theoretic paradoxes, and demonstrate that proper vertex colouring can be a paradoxical colouring rule.

We construct a groupoid equivariant Kasparov class for transversely oriented foliations in all codimensions. In codimension 1 we show that the Chern character of an associated semifinite spectral triple recovers the Connes-Moscovici cyclic…