相关论文: On Kruskal's theorem that every 3 x 3 x 3 array ha…

We compute the integral cohomology rings of a family of 3-groups. As a corollary, we exhibit, for each n greater than or equal to 5, a pair of groups of order 3^n whose integral cohomology rings are isomorphic.

Maximal clique enumeration appears in various real-world networks, such as social networks and protein-protein interaction networks for different applications. For general graph inputs, the number of maximal cliques can be up to…

For an integer $k$ at least $2$, and a graph $G$, let $f_k(G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $G-X$ has either $k$ vertices of maximum degree or order less than $k$. Caro and Yuster (Discrete…

The classical Kruskal-Katona theorem gives a tight upper bound for the size of an $r$-uniform hypergraph $\mathcal{H}$ as a function of the size of its shadow. Its stability version was obtained by Keevash who proved that if the size of…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. A reduced graph $G$ is said to be maximal if any reduced…

We use rational parametrizations of certain cubic surfaces and an explicit formula for descent via 3-isogeny to construct the first examples of elliptic curves E_k: x^3 + y^3 = k of ranks 8, 9, 10, and 11 over Q. As a corollary we produce…

We consider uniformly random strictly upper-triangular matrices in $\operatorname{Mat}_n(\mathbb{F}_q)$. For such a matrix $A_n$, we show that $n-\operatorname{rank}(A_n) \approx \log_q n$ as $n \to \infty$, and find that the fluctuations…

The conclusion that the length of an arithmetic progression of the form ${3^x+2^y}$ is at most six is proved.

We prove that for every $\epsilon > 0$ there exists a $\delta > 0$ so that every group of order $n \geq 3$ has at least $\delta \log_{2} n/{(\log_{2} \log_{2} n)}^{3+\epsilon}$ conjugacy classes. This sharpens earlier results of Pyber and…

We prove a refined version of Markov's theorem in Diophantine approximation. More precisely, we characterize completely the set of irrationals $x$ such that $\left|x-\frac{p}{q}\right|<\frac{1}{3q^2}$ has only finitely many rational…

We give a complete classification of globally generated vector bundles of rank 3 on a smooth quadric threefold with $c_1\leq 2$ and extend the result to arbitrary higher rank case. We also investigate the existence of globally generated…

We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices, which allows us to prove that [6(n+1)/7] linear inequalities suffice to describe a convex n-gon up to a linear projection.

We prove that every connected graph with $s$ vertices of degree~1 and 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}$ leaves. We present infinite series of graphs showing that…

We prove the sharp upper bound of at most $52$ lines on a complex K3-surface of degree four with a non-empty singular locus. We also classify the configurations of more than $48$ lines on smooth complex quartics.

In Dokchitser (2007) it is shown that given an elliptic curve $E$ defined over a number field $K$ then there are infinitely many degree 3 extensions $L/K$ for which the rank of $E(L)$ is larger than $E(K)$. In the present paper we show that…

A vertex k-ranking is a labeling of the vertices of a graph with integers from 1 to k so any path connecting two vertices with the same label will pass through a vertex with a greater label. The rank number of a graph is defined to be the…

A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Gr\"otzsch Theorem that every planar triangle-free graph is 3-colorable. In this paper we use the…

In a recent paper, Bruhn, Diestel, Kriesell and Wollan (arXiv:1003.3919) present four systems of axioms for infinite matroids, in terms of independent sets, bases, closure and circuits. No system of rank axioms is given. We give an easy…

Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…

We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal graphs, meaning those that maximize or minimize 33 degree-based topological indices. This study shows that five graph…