Related papers: The $p$-Adic Valuation Trees for Quadratic Polynom…

We provide lower bounds for p-adic valuations of multisums of factorial ratios which satisfy an Ap\'ery-like recurrence relation: these include Ap\'ery, Domb, Franel numbers, the numbers of abelian squares over a finite alphabet, and…

Place value numbers, such as the binary or decimal numbers can be represented by the end vertices (leaf or pendant vertices) of rooted symmetrical trees. Numbers that consist of at most a fixed number of digits are represented by vertices…

Cubic and quartic non-autonomous differential equations with continuous piecewise linear coefficients are considered. The main concern is to find the maximum possible multiplicity of periodic solutions. For many classes, we show that the…

Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…

In this work nonlinear pseudo-differential equations with the infinite number of derivatives are studied. These equations form a new class of equations which initially appeared in p-adic string theory. These equations are of much interest…

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…

Fix a prime $p$. We prove that the set of sentences true in all but finitely many finite extensions of $\mathbb{Q}_p$ is undecidable in the language of valued fields with a cross-section. The proof goes via reduction to characteristic $p$,…

In this paper we apply Ax-Schanuel's Theorem to the ultraproduct of $p$-adic fields in order to get some results towards algebraic independence of $p$-adic exponentials for almost all primes $p$.

To a definable subset of Z_p^n (or to a scheme of finite type over Z_p) one can associate a tree in a natural way. It is known that the corresponding Poincare series P(X) = \sum_i N_i X^i is rational, where N_i is the number of nodes of the…

We study the repartition of the roots of a random p-adic polynomial in an algebraic closure of Qp.We prove that the mean number of roots generating a fixed finite extension K of Qp depends mostly on the discriminant of K, an extension…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

Let $A$ be an associative algebra graded by a finite group $G$ over a field ${F}$ of characteristic zero. One associates to $A$ the sequence of $G$-graded codimensions $c_n^G(A)$, $n=1,2,\ldots$, which measures the growth of the polynomial…

We consider the ensemble of N-dimensional random symmetric matrices A that have, in average, p non-zero elements per row. We study the asymptotic behavior of the norm of A in the limit of infinitely increasing N and p. We prove that the…

We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…

We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…

We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of…

We continue our study of residual properties of mapping tori of free group endomorphisms. In this paper, we prove that each of these groups are virtually residually (finite $p$)-groups for all but finitely many primes$p$. The method…

We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…

We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…

The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…