相关论文: Two-dimensional cycle classes on $\overline{\mathc…

We analyze the dynamics of a class of $\mathbb{Z}_{2n}$-equivariant differential equations on the plane, depending on 4 real parameters. This study is the generalisation to $\mathbb{Z}_{2n}$ of previous works with $\mathbb{Z}_4$ and…

For all integers $k$ with $k\geq 2$, if $G$ is a balanced $k$-partite graph on $n\geq 3$ vertices with minimum degree at least \[…

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…

We construct a canonical basis of two-cycles, on a $K3$ surface, in which the intersection form takes the canonical form $2E_8(-1) \oplus 3H$. The basic elements are realized by formal sums of smooth submanifolds.

According to Browder if $4n+2\neq 2^{t+1}-2$ then the Kervaire invariant of the cobordism class of a $(4n+2)$-dimensional manifold $M^{4n+2}$ vanishes and $M^{2^{t+1}-2}$ is of Kervaire invariant one if and only if…

Let $n\geq 2$ be an integer, and let $i\in\{0,...,n-1\}$. An $i$-th dimension edge in the $n$-dimensional hypercube $Q_n$ is an edge ${v_1}{v_2}$ such that $v_1,v_2$ differ just at their $i$-th entries. The parity of an $i$-th dimension…

In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ vertices is contained in at least $\lfloor…

We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound…

The collection of cyclic Hadamard matrices {H = (a_{i - j}) : 0 <= i, j < n, and a_i = -1, 1} of order n is characterized by the orthogonality relation HH^T = nI. Only two of such matrices are currently known. It will be shown that this…

It is known that the $n$-dimensional hypercube $Q_n,$ for $n$ even, has a decomposition into $k$-cycles for $k=n, 2n,$ $2^l$ with $2 \leq l \leq n.$ In this paper, we prove that $Q_n$ has a decomposition into $2^mn$-cycles for $n \geq 2^m.$…

It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order $2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

In this paper, we prove that the statement: ``The (Generalized) Hodge Conjecture holds for codimension-two cycles on a smooth projective variety $X$" is a birationally invariant statement, that is, if the statement is true for $X$, it is…

Heteroclinic cycles are sequences of equilibria along with trajectories that connect them in a cyclic manner. We investigate a class of robust heteroclinic cycles that does not satisfy the usual condition that all connections between…

Provided that a cohomological model for $G$ is known, we describe a method for constructing a basis for $n$-cocycles over $G$, from which the whole set of $n$-dimensional $n$-cocyclic matrices over $G$ may be straightforwardly calculated.…

With the couplings between the eight gluons constrained by the structure constants of the su(3) algebra in QCD, one would expect that there should exist a special basis (or set of bases) for the algebra wherein, unlike in a Cartan-Weyl…

We consider the classical problem of a position of n-dimensional manifold M in R^{n+2}. We show that we can define the fundamental (n+1)-cycle and the shadow fundamental (n+2)-cycle for a fundamental quandle of a knotting M to R^{n+2}. In…

Recently, binary cyclic codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construct four classes of binary cyclic codes…

A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and…

Let $X$ be a cubic hypersurface in $\mathbb P^6$ or a hypersurface of degree greater than equal to $7$ in $\mathbb P^5$. In this note we try to understand, for a very general hyperplane section of $X$, the non-injectivity locus of the…