Related papers: Countably many asymptotic tensor ranks

For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on $k$ vertices. For $k\geq4$, we show that the exponent per edge is at most 0.77, outperforming…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

We prove that the polynomials counting locally free, absolutely indecomposable, rank 1 representations of quivers over rings of truncated power series have non-negative coefficients. This is a generalisation to higher depth of positivity…

We classify up to coarse equivalence all countable abelian groups of finite torsion free rank. The Q-cohomological dimension and the torsion free rank are the two invariants that give us such classification. We also prove that any countable…

Recently, many structured tensors are defined and their properties are discussed in the literature. In this paper, we introduce a new class of structured tensors, called exceptionally regular tensor, which is relevant to the tensor…

A statistic can be a function of multiple samples. There is little existing work on asymptotic theory for such statistics when group membership is random. We propose a flexible framework that can handle both deterministic and random…

In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…

Let $\mathbb{N}$ denote the set of all nonnegative integers and $A$ be a subset of $\mathbb{N}$. Let $h\geq2$ and let $r_h(A,n)=\sharp \{ (a_1,\ldots,a_h)\in A^{h}: a_1+\cdots+a_h=n\}.$ The set $A$ is called an asymptotic basis of order $h$…

In this paper the asymptotic distribution of estimators is derived in a general regression setting where rank restrictions on a submatrix of the coefficient matrix are imposed and the regressors can include stationary or I(1) processes.…

In our previous papers we introduced categorical invariants, which are, roughly speaking, sets of triangulated subcategories in a given triangulated category and their quotients. Here is extended the list of examples, where these sets are…

We show that there exists a separable, nuclear C*-algebra with real rank zero and trivial K-theory such that its multiplier and corona algebra have real rank one. This disproves two conjectures of Brown and Pedersen. We also compute the…

We say that a list of complex numbers is "realisable" if it is the spectrum of some (entrywise) nonnegative matrix. The Nonnegative Inverse Eigenvalue Problem (NIEP) is the problem of characterising all realisable lists. Although the NIEP…

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

Most regularized tensor regression research focuses on tensors predictors with scalars responses or vectors predictors to tensors responses. We consider the sparse low rank tensor on tensor regression where predictors $\mathcal{X}$ and…

The category of admissible (in the appropriately modified sense of representation theory of totally disconnected groups) semi-linear representations of the automorphism group of an algebraically closed extension of infinite transcendence…

We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.

Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of…