Related papers: An effective analysis of the Denjoy rank
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…
We examine affine correspondences of the form g(y)=f(x), for f and g polynomials satisfying deg(g) < deg(f), with the property that every critical point of the correspondence admits at least one finite forward orbit. In the case g(y)=y,…
In this paper we develop accelerated first-order methods for convex optimization with locally Lipschitz continuous gradient (LLCG), which is beyond the well-studied class of convex optimization with Lipschitz continuous gradient. In…
Let X(F,G) be the G-character variety of F where G is a rank 1 complex affine algebraic group and F is a finitely presentable discrete group. We describe an algorithm, which we implement in Mathematica, SageMath, and in Python, that takes a…
If F is an infinitely differentiable function whose composition with a blowing-up belongs to a Denjoy-Carleman class C_M (determined by a log convex sequence M=(M_k)), then F, in general, belongs to a larger shifted class C_N, where N_k =…
In this paper, we analyze the fundamental conditions for low-rank tensor completion given the separation or tensor-train (TT) rank, i.e., ranks of unfoldings. We exploit the algebraic structure of the TT decomposition to obtain the…
We investigate families of subsets of $\omega$ with almost disjoint refinements in the classical case as well as with respect to given ideals on $\omega$. More precisely, we study the following topics and questions: 1) Examples of…
We introduce a Poisson version of the graded twist of a graded associative algebra and prove that every graded Poisson structure on a connected graded polynomial ring $A:=\Bbbk[x_1,\ldots,x_n]$ is a graded twist of a unimodular Poisson…
Tree balance has received considerable attention in recent years, both in phylogenetics and in other areas. Numerous (im)balance indices have been proposed to quantify the (im)balance of rooted trees. A recent comprehensive survey…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for…
We introduce a 2-round stochastic constraint-satisfaction problem, and show that its approximation version is complete for (the promise version of) the complexity class AM. This gives a `PCP characterization' of AM analogous to the PCP…
We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…
Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the…
We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…
The purpose of this paper is to prove a new general result about rings of complex analytic functions. Let $\Omega$ be an arbitrary nonempty open subset of the complex plane $\mathbb C$, $\mathcal{A}(\Omega)$ be the set of holomorphic…
We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic…
Let $\Gamma$ be a Zariski dense discrete subgroup of a connected simple real algebraic group $G_1$. We discuss a rigidity problem for discrete faithful representations $\rho:\Gamma\to G_2$ and a surprising role played by higher rank…