相关论文: H-Kernels by Walks

If ${\cal H}=(V,{\cal E})$ is a hypergraph, its edge intersection hypergraph $EI({\cal H})=(V,{\cal E}^{EI})$ has the edge set ${\cal E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in {\cal E} \ \wedge \ e_1 \neq e_2 \ \wedge \ |e_1 \cap e_2…

We show that every $2$-connected cubic graph $G$ has a cycle double cover if $G$ has a spanning subgraph $F$ such that (i) every component of $F$ has an even number of vertices (ii) every component of $F$ is either a cycle or a subdivision…

In the quarter plane, five lattice path models with unit steps have resisted the otherwise general approach of Fayolle, Rachel, and Kurkova. Here we consider these five models, called the singular models, and prove that the generating…

We show that for each \ell\geq 4 every sufficiently large oriented graph G with \delta^+(G), \delta^-(G) \geq \lfloor |G|/3 \rfloor +1 contains an \ell-cycle. This is best possible for all those \ell\geq 4 which are not divisible by 3.…

We establish that a category of fibrant objects (in the sense of Brown) admits a Dwyer-Kan homotopical calculus of right fractions. This is done using a homotopical calculus of cocycles, which is an auxiliary structure that can be defined…

Let $\Gamma$ be a chain of cycles of genus $g$. Let $d$,$r$ be integers with $1 \leq r \leq g-2$ and $2r\leq d \leq g-3+r$. Then $w^r_d(\Gamma)=d-2r$ implies $\Gamma$ is hyperelliptic. For each $g \geq 2r+3$ there exist non-hyperelliptic…

We consider a product $X=E_1\times\cdots\times E_d$ of elliptic curves over a finite extension $K$ of $\mathbb{Q}_p$ with a combination of good or split multiplicative reduction. We assume that at most one of the elliptic curves has…

We study $M$-alternating Hamilton paths and $M$-alternating Hamilton cycles in a simple connected graph $G$ on $\nu$ vertices with a perfect matching $M$. Let $G$ be a bipartite graph, we prove that if for any two vertices $x$ and $y$ in…

We define a topological Hochschild (THH) and cyclic (TC) homology theory for differential graded (dg) categories and construct several non-trivial natural transformations from algebraic K-theory to THH(-). In an intermediate step, we prove…

Let G be an algebraic group and let X be a smooth integral scheme over a field k. In this paper we construct homology-type groups $H_i(X,G)$ by considering cycles in the simplicial scheme $BG\times X (an idea suggested by Andrei Suslin). We…

A diffeomorphism f has a heterodimensional cycle if it displays two (transitive) hyperbolic sets K and K' with different indices such that the unstable set of K intersects the stable one of K' and vice versa. We prove that it is possible to…

We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a…

We consider Hamilton cycles in the random digraph $D_{n,m}$ where the orientation of edges follows a pattern other than the trivial orientation in which the edges are oriented in the same direction as we traverse the cycle. We show that if…

We show that if $n$ is odd and $p \ge C \log n / n$, then with high probability Hamilton cycles in $G(n,p)$ span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties.…

Let $H$ be a Hopf algebra and let $\mathcal D_H$ be a Hopf-module category. We describe the cocycles and coboundaries for the Hopf cyclic cohomology of $\mathcal D_H$, which correspond respectively to categorified cycles and vanishing…

A digraph $G$ is weightable if its edges can be weighted with real numbers such that the total weight in each directed cycle equals 1. There are several equivalent conditions: that $G$ admits a 0/1-weighting with the same property, or that…

Let $C_{m} $ be a cyclic group of order $m$. We prove that if the group $G$ fits into an extension $1\to C_{2^{n+1}}^2\to G\to C_2\to 1$ then $G$ is good in the sense of Hopkins-Kuhn-Ravenel, i.e., $K(s)^*(BG)$ is evenly generated by…

Let D be an acyclic orientation of a simple graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Define m and M to be the minimum and the maximum number of…

We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey number r(H) of H does not change upon adding it to H. This notion was introduced by Balister, Lehel and Schelp who also proved that cycles…

We prove that for all $k\geq 4$ and $1\leq\ell<k/2$, every $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices with $\delta_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+o(1)\right)\binom{n}{2}$ contains a Hamiltonian…