Related papers: A generalization of a theorem about gapsets with d…

In 1962 P\'osa conjectured that every graph G on n vertices with minimum degree at least 2n/3 contains the square of a hamiltonian cycle. In 1996 Fan and Kierstead proved the path version of P\'osa's Conjecture. They also proved that it…

In this paper we prove Conjecture \ref{conj1} for a set of representations of the group $GL_n({\bf A})$. This Conjecture is stated in complete generality as Conjecture 1 in \cite{G2}, and here we prove it for various cases. See Conjecture…

In this article, we prove a generalization of a theorem (Ogg's conjecture) due to Bary Mazur for arbitrary $N\in \N$ and for {\it number fields}. The main new observation is a modification of a theorem due to Glenn Stevens for the…

David Gabai showed that disk decomposable knot and link complements carry taut foliations of depth one. In an arbitrary sutured 3-manifold M, such foliations F, if they exist at all, are determined up to isotopy by an associated ray [F]…

We introduce a notion of depth three tower of three rings C < B < A with depth two ring extension A | B recovered when B = C. If A = \End B_C and B | C is a Frobenius extension, this captures the notion of depth three for a Frobenius…

We prove the following conjecture of Shkredov and Solymosi: every subset $A \subset \mathbf{Z}^2$ such that $\sum_{a\in A\setminus\{0\}} 1/\left\|a\right\|^{2} = +\infty$ contains the three vertices of an isosceles right triangle. To do…

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

Fix $k \geq 6$. We prove that any large enough finite group $G$ contains $k$ elements which span quadratically many triples of the form $(a,b,ab) \in S \times G$, given any dense set $S \subseteq G \times G$. The quadratic bound is…

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

We deal with the distribution of N points placed consecutively around the circle by a fixed angle of a. From the proof of Tony van Ravenstein, we propose a detailed proof of the Steinhaus conjecture whose result is the following: the N…

J.F. Carlson conjectured in 1995 that if G is a finite group and k is a field whose characteristic p divides the order of G that the depth of H*(G,k) equals the minimum of the dimensions of associated primes of H*(G,k). This is obviously…

The dead-end depth of an element g of a group G, with respect to a generating set A is the distance from g to the complement of the radius $d_A(1,g)$ closed ball, in the word metric $d_A$ defined with respect to A. We exhibit a finitely…

A generalized numerical semigroup is a submonoid of $\mathbb{N}^d$ with finite complement in it. In this work we study some properties of three different classes of generalized numerical semigroups. In particular, we prove that the first…

The Powell Conjecture states that the Goeritz group of the Heegaard splitting of the $3$-sphere is finitely generated; furthermore, four specific elements suffice to generate the group. Zupan demonstrated that the conjecture holds if and…

A gapset is the complement of a numerical semigroup in N. In this paper, we characterize all gapsets of multiplicity m $\le$ 4. As a corollary, we provide a new simpler proof that the number of gapsets of genus g and fixed multiplicity m…

The three distance theorem (also known as the three gap theorem or Steinhaus problem) states that, for any given real number $\alpha$ and integer $N$, there are at most three values for the distances between consecutive elements of the…

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

In this paper we extend some set theoretic concepts of numerical semigroups for arbitrary sub-semigroups of natural numbers. Then we characterized gapsets which leads to a more efficient computational approach towards numerical semigroups…

We extend the theory of generalized divisors so as to work on any scheme $X$ satisfying the condition $S_2$ of Serre. We define a generalized notion of Gorenstein biliaison for schemes in projective space. With this we give a new proof in a…