相关论文: Markov complexity of monomial curves

The purpose of this paper is to exhibit infinite families of conjugate projective curves in a number field whose complement have the same abelian fundamental group, but are non-homeomorphic. In particular, for any $d>3$ we find Zariski…

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…

Let $f$ be a pseudo-Anosov homeomorphism on a closed, oriented surface. We give an effective construction of Markov partitions for $f$ based on a simple combinatorial criterion deciding when an immersed graph bounds a Markov partition. This…

Given an ideal $\mathcal{I}$ on the nonnegative integers $\omega$ and a Polish space $X$, let $\mathscr{L}(\mathcal{I})$ be the family of subsets $S\subseteq X$ such that $S$ is the set of $\mathcal{I}$-limit points of some sequence taking…

Let $N>1$ be an integer coprime to $6$ such that $N\notin\{5,7,13\}$ and let $g=g(N)$ be the genus of the modular curve $X_0(N)$. We compute the intersection matrices relative to special fibres of the minimal regular model of $X_0(N)$.…

Let $\mathcal{S}$ be the set of all positive-definite, symmetrizable integer matrices with non-zero upper and lower diagonal and $\mathcal{T}$ to be the set of all positive-definite real symmetric matrices with nonzero upper diagonal such…

Let $k$ be an arbitrary field. In this note, we show that if a sequence of relatively prime positive integers ${\bf a}=(a_1,a_2,a_3,a_4)$ defines a Gorenstein non complete intersection monomial curve ${\mathcal C}({\bf a})$ in ${\mathbb…

We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…

Let a set of nodes $\mathcal X$ in the plane be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Assume that $\#\mathcal X=d(n,k-3)+3= (n+1)+n+\cdots+(n-k+5)+3$ and $4 \le k\le n-1.$ In this paper we prove that…

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most $n$, is $2^{n+O(1)}$. If we replace "everywhere" by "for all sufficiently large inputs", the…

Let $\Lambda$ be a numerical semigroup, $\mathcal{C}\subseteq \mathbb{A}^n$ the monomial curve singularity associated to $\Lambda$, and $\mathcal{T}$ its tangent cone. In this paper we provide a sharp upper bound for the least positive…

Let $a, b$ and $n > 1$ be three positive integers such that $a$ and $\sum_{j=0}^{n-1} b^j$ are relatively prime. In this paper, we prove that the toric ideal $I$ associated to the submonoid of $\mathbb{N}$ generated by $\{\sum_{j=0}^{n-1}…

We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…

In this article, we introduce the generalized complexity of a generalized Calabi--Yau pair $(X,B,\textbf{M})$. This invariant compares the dimension of $X$ and Picard rank of $X$ with the sum of the coefficients of $B$ and $\textbf{M}$. It…

We study the computational model where we can access a matrix $\mathbf{A}$ only by computing matrix-vector products $\mathbf{A}\mathrm{x}$ for vectors of the form $\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_q$. We prove…

Extending the notion of indispensable binomials of a toric ideal, we define indispensable monomials of a toric ideal and establish some of their properties. They are useful for searching indispensable binomials of a toric ideal and for…

We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in…

Let $I \subseteq R = \mathbb{K}[x_1,\ldots,x_n]$ be a toric ideal, i.e., a binomial prime ideal. We investigate when the ideal $I$ can be "split" into the sum of two smaller toric ideals. For a general toric ideal $I$, we give a sufficient…