Related papers: Torsion orders of complete intersections

A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any $n$ simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same…

The goal of this note is to provide yet another proof of the following theorem of Golod: there exists an infinite finitely generated group $G$ such that every element of $G$ has finite order. Our proof is based on the Nielsen-Schreier index…

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…

It is proved that if $G$ is a $t$-tough graph of order $n$ and minimum degree $\delta$ with $t>1$ then either $G$ has a cycle of length at least $\min\{n,2\delta+5\}$ or $G$ is the Petersen graph.

In \cite{striker2018rowmotion} Striker generalized Cameron and Fon-Der-Flaass's notion of a toggle group. In this paper we begin the study of transitive generalized toggle groups that contain a cycle. We first show that if such a group has…

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

We prove several Littlewood-Offord type inequalities for arbitrary groups. In groups having elements of finite order the worst case scenario is provided by the simple random walk on a certain cyclic subgroup. The inequalities we obtain are…

We prove the complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions

Let k be a number field and X a smooth projective k-variety. In this paper, we study the information obtainable from descent via torsors under finite k-group schemes on the location of the k-rational points on X within the adelic points.…

For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…

We extend the functional Breuer-Major theorem by Nourdin and Nualart (2020) to the space of rough paths. The proof of tightness combines the multiplication formula for iterated Malliavin divergences, due to Furlan and Gubinelli (2019), with…

Minimum spanning trees are important tools in the analysis and design of networks. Many practical applications require their computation, ranging from biology and linguistics to economy and telecommunications. The set of cycles of a network…

Polstra showed that the cardinality of the torsion subgroup of the divisor class group of a local strongly $F$-regular ring is finite. We expand upon this result and prove that the reciprocal of the $F$-signature of a local strongly…

The point sets of all known optimal rectilinear drawings of $K_n$ share an unmistakeable clustering property, the so--called {\em 3--decomposability}. It is widely believed that the underlying point sets of all optimal rectilinear drawings…

In this work we prove a bound for the torsion in Mordell-Weil groups of smooth elliptically fibered Calabi-Yau 3- and 4-folds. In particular, we show that the set which can occur on a smooth elliptic Calabi-Yau $n$-fold for ($n\geq 3$) is…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

Let M be a subset of {0, .., n} and F be a family of subsets of an n element set such that the size of A intersection B is in M for every A, B in F. Suppose that l is the maximum number of consecutive integers contained in M and n is…

Present article deals with trajectorial intersections in linear fractional systems ('systems'). We propose a classification of intersections of trajectories in three classes viz. trajectories intersecting at same time(EIST), trajectories…

A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and can distinguish its own location from its neighbors. We…

We prove that every local complete intersection curve in $Spec(A)$, where $A$ is a commutative Noetherian ring of dimension three, is a set-theoretic complete intersection. An analogous result is established for local complete intersection…