Related papers: Identifying logarithmic tracts
In this article we study rational curves with a unique unibranch genus-$g$ singularity, which is of {\it $\ka$-hyperelliptic} type in the sense of \cite{To}; we focus on the cases $\ka=0$ and $\ka=1$, in which the semigroup associated to…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
The geometric condition of T. Saito for trivial action of the wild monodromy of a smooth proper curve over the generic point of a trait is transformed to the condition of logarithmic smooth reduction. The proof emphasizes methods and…
A simple linear loop is a simple while loop with linear assignments and linear loop guards. If a simple linear loop has only two program variables, we give a complete algorithm for computing the set of all the inputs on which the loop does…
In terms of the best approximations of functions and generalized moduli of smoothness, direct and inverse approximation theorems are proved for Besicovitch almost periodic functions whose Fourier exponent sequences have a single limit point…
We give examples of sequences of smooth non-isotrivial curves for every genus at least two, defined over a rational function field of positive characteristic, such that the (finite) number of rational points of the curves in the sequence…
The Riemann-Roch theorem is of utmost importance in the algebraic geometric theory of compact Riemann surfaces. It tells us how many linearly independent meromorphic functions there are having certain restrictions on their poles. The aim of…
We present some results about the number of rational points on a certain family of curves defined over a finite field. In a small number of cases the curves have more rational points than expected. Fibonacci numbers make an appearance, as…
We give explicit bounds on the intersection number between any curve on a tight multigeodesic and the two ending curves. We use this to construct all tight multigeodesics and so conclude that distances in the curve graph are computable. The…
We introduce a class of iterated logarithmic Lipschitz spaces $\mathcal{L}^{(k)}$, $k\in\mathbb{N}$, on an infinite tree which arise naturally in the context of operator theory. We characterize boundedness and compactness of the…
We achieve an extremely useful description (up to isomorphism) of the Leavitt path algebra $L_K(E)$ of a finite graph $E$ with coefficients in a field $K$ as a direct sum of matrix rings over $K$, direct sum with a corner of the Leavitt…
In this monograph, we study complexity classes that are defined using $O(\log n)$-space bounded non-deterministic Turing machines. We prove salient results of Computational Complexity in this topic such as the Immerman-Szelepcsenyi Theorem,…
Let f:X-->R be a function defined on a connected nonsingular real algebraic set X in R^n. We prove that regularity of f can be detected on either algebraic curves or surfaces in X. If dimX>1 and k is a positive integer, then f is a regular…
In this note, we give an alternative proof of uniform boundedness of the number of integral points of smooth projective curves over a fixed number field with good reduction outside of a fixed set of primes. We use that due to…
We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…
We investigate the real algebraic complexity of contours of amoebas associated with algebraic hypersurfaces and complete intersections in complex algebraic tori. Motivated by the foundational estimates of Lang--Shapiro--Shustin \cite{LSS},…
We discuss such Maltsev conditions that consist of just one linear equation, we call them loop conditions. To every such condition can be assigned a graph. We provide a classification of conditions with undirected graphs. It follows that…
A simple proof is given of the known fact that an m-times continuously differentiable function on the real line can be approximated along with its derivatives by an entire function and its respective derivatives.
The coamoeba of any complex algebraic plane curve $V$ is its image in the real torus under the argument map. The area counted with multiplicity of the coamoeba of any algebraic curve in $(\mathbb{C}^*)^2$ is bounded in terms of the degree…
We show that the class of chordal claw-free graphs admits LREC$_=$-definable canonization. LREC$_=$ is a logic that extends first-order logic with counting by an operator that allows it to formalize a limited form of recursion. This…