Related papers: Torsion orders of complete intersections

Let $G$ be a group and $g$ a non-trivial element in $G$. If some non-empty finite product of conjugates of $g$ equals to the identity, then $g$ is called a generalized torsion element. The minimum number of conjugates in such a product is…

In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum…

Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which…

We study torsion in the integral cohomology of a certain family of $2n$-dimensional orbifolds $X$ with actions of the $n$-dimensional compact torus. Compact simplicial toric varieties are in our family. For a prime number $p$, we find a…

Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…

In 2006, Marcus and Tardos proved that if $A^1,\dots,A^n$ are cyclic orders on some subsets of a set of $n$ symbols such that the common elements of any two distinct orders $A^i$ and $A^j$ appear in reversed cyclic order in $A^i$ and $A^j$,…

Given a finite simplicial complex, a unimodular representation of its fundamental group and a closed twisted cochain of odd degree, we define a twisted version of the Reidemeister torsion, extending a previous definition of V. Mathai and S.…

A famous conjecture of Ryser states that any $r$-partite set system has transversal number at most $r-1$ times their matching number. This conjecture is only known to be true for $r\leq3$ in general, for $r\leq5$ if the set system is…

The Bounded Negativity Conjecture predicts that for any smooth complex surface $X$ there exists a lower bound for the selfintersection of reduced divisors on $X$. This conjecture is open. It is also not known if the existence of such a…

Working over an algebraically closed field of arbitrary characteristic we study, for integers $N\geq 2$ and $g\geq 2$, the set of points of order dividing $N$ lying on an irreducible smooth proper curve of genus $g$ embedded in its jacobian…

For 0-cycles on a variety over a number field, we define an analogue of the classical descent set for rational points. This leads to, among other things, a definition of the \'etale-Brauer obstruction set for 0-cycles, which we show is…

Let A denote the algebraic closure of the rationals Q in the complex numbers C. Suppose G is a torsion-free group which contains a congruence subgroup as a normal subgroup of finite index and denote by U(G) the C-algebra of closed densely…

We present an alternate proof of a result of F\'eray and Reiner characterizing posets whose $P$-partition rings are complete intersections. This shortened proof relates the complete intersection property to a simple structural property of a…

We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…

Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…

In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial $k$-uniform, $d$-wise intersecting family for $n\ge \left(1+\frac{d}{2}\right)(k-d+2)$,…

Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…

In a recent joint work with V. Turaev (cf. math.DG/9810114) we defined a new concept of combinatorial torsion which we called absolute torsion. Compared with the classical Reidemeister torsion it has the advantage of having a well-defined…

A new characterization of rational torsion subgroups of elliptic curves is found, for points of order greater than 4, through the existence of solution for systems of Thue equations.

Classical descent theory of Colliot-Th\'el\`ene and Sansuc for rational points tells that, over a smooth variety $X$, the algebraic Brauer--Manin subset equals the descent obstruction subset defined by a universal torsor. Moreover, Harari…