相关论文: Comlexity of prime-dimensional sequences over a fi…

We derive B\'ezout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel's conjecture and…

In recent decades, the defect of finite extensions of valued fields has emerged as the main obstacle in several fundamental problems in algebraic geometry such as the local uniformization problem. Hence, it is important to identify…

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…

This paper deals with the complexity of strings, which play an important role in biology (nucleotid sequences), information theory and computer science. The d-complexity of a string is defined as the number of its distinct d-substrings…

We define a notion of complexity for shake-slice knots which is analogous to the definition of complexity for h-cobordisms studied by Morgan-Szab\'o. We prove that for each framing $n \ne 0$ and complexity $c \ge 0$, there is an…

The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…

We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…

We show that the difference between consecutive terms in sequences of integers whose greatest prime factor grows slowly tends to infinity.

The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…

We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an $\aleph_0$-categorical theory is $\Pi^0_3$-complete; and the property of being an Ehrenfeucht…

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is…

Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…

Pillai showed that any sequence of consecutive integers with at most 16 terms possesses one term that is relatively prime to all the others. We give a new proof of a slight generalization of this result to arithmetic progressions of…

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $\epsilon>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$…

In this work we introduce a new notion called opacity complexity to measure the complexity of automatic sequences. We study basic properties of this notion, and exhibit an algorithm to compute it. As applications, we compute the opacity…

It is shown that the sum of class numbers of orders in totally complex quartic fields with no real quadratic subfield obeys an asymptotic law similar to the prime numbers, as the bound on the regulators tends to infinity. Here only orders…

Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…

The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan. At the end of the first section I examine tree-balancing. In the second section I summarize the…