相关论文: On a Question of Gowers on Clique Differences

Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an $n$ vertex graph, and need to output a clique. We show that if the input graph is drawn at random from $G_{n,\frac{1}{2}}$ (and hence…

We give an explicit formulation of the weight part of Serre's conjecture for GL_2 using Kummer theory. This avoids any reference to p-adic Hodge theory. The key inputs are a description of the reduction modulo p of crystalline extensions in…

Let K be an abstract elementary class satisfying the joint embedding and the amalgamation properties. Let m be a cardinal above the the L\"owenheim-Skolem number of the class. Suppose K satisfies the disjoint amalgamation property for limit…

We describe the derived category of coherent sheaves on the minimal resolution of the Kleinian singularity associated to a finite subgroup G of SL(2). Then, we give an application to the Euler-characteristic version of the Hall algebra of…

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

The trapezoidal Fox conjecture states that the coefficient sequence of the Alexander polynomial of an alternating knot is unimodal. We are motivated by a harder question, the strong Fox conjecture, which asks whether the coefficient…

A celebrated theorem of Selberg states that for congruence subgroups of SL(2,Z) there are no exceptional eigenvalues below 3/16. We prove a generalization of Selberg's theorem for infinite index "congruence" subgroups of SL(2,Z).…

This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…

We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…

We show that some classical results on expander graphs imply growth results on normal subsets in finite simple groups. As one application, it is shown that given a nontrivial normal subset $ A $ of a finite simple group $ G $ of Lie type of…

We investigate a fifty-year-old conjecture of Erd\H{o}s and Graham concerning whether the binomial coefficient ${n \choose k}$ with $1 \leq k \leq \frac{n}{2}$ must always have a divisor $\leq n$ that is ``close'' to $n$: that is, bigger…

This work studies skew polycyclic codes over finite chain rings defined by central trinomials. For this class of codes, we investigate Hamming equivalence in the non-commutative (skew) setting. We introduce an equivalence relation on the…

We generalize the Guth--Katz joints theorem from lines to varieties. A special case says that $N$ planes (2-flats) in 6 dimensions (over any field) have $O(N^{3/2})$ joints, where a joint is a point contained in a triple of these planes not…

In this paper, we present a new lower bound on the size of separating hash families of type {w_1^{q-1},w_2} where w_1 < w_2. Our result extends the paper by Guo et al. on binary frameproof codes. This bound compares well against known…

In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size c>3 are present in random Erdos and Renyi graphs only in the limit of diverging average connectivity. Starting…

We prove a strengthening of Brauer's height zero conjecture for principal 2-blocks with Galois automorphisms. This requires a new extension of the It\^o--Michler theorem for the prime~2, again with Galois automorphisms. We close, this time…

The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…

This note is a response to one of problems posed by A.K. Kwasniewski in one of his recent papers. Namely for the sequence of finite cobweb subposets, the looked for explicit formulas for corresponding sequence of characteristic polynomials…

This paper is a survey on the study of the behaviour of the composition of polynomials on the computation of Gr\"obner bases. This survey brings together some works published between 1995 and 2007. The authors of these papers gave answers…

Let $G$ be a 2-connected $n$-vertex graph and $N_s(G)$ be the total number of $s$-cliques in $G$. Let $k\ge 4$ and $s\ge 2$ be integers. In this paper, we show that if $G$ has an edge $e$ which is not on any cycle of length at least $k$,…