Related papers: Factors of generalised polynomials and automatic s…
We generalize the classical notion of adjoint of a linear operator and the Aron-Schottenloher notion of adjoint of a homogeneous polynomial. The general notion is shown to enjoy several properties enjoyed by the classical ones, nevertheless…
In this short note, we give a very simple but useful generalization of a result of Vershynin (Theorem 5.39 of [1]) for a random matrix with independent sub-Gaussian rows. We also explain with an example where our generalization is useful.
On the plane, every random compact set with almost surely uncountable first projection intersects with a high probability the graph of some continuous function. Implication: every black noise over the plane fails to factorize when the plane…
The ordinary continued fractions expansion of a real number is based on the Euclidean division. Variants of the latter yield variants of the former, all encompassed by a more general Dynamical Systems framework. For all these variants the…
In the present paper we define the notion of generalized cumulants which gives a universal framework for commutative, free, Boolean, and especially, monotone probability theories. The uniqueness of generalized cumulants holds for each…
We prove that if nonlinear complex polynomials of the same degree have orbits with infinite intersection, then the polynomials have a common iterate. We also prove a special case of a conjectured dynamical analogue of the Mordell-Lang…
We study bracket words, which are a far-reaching generalisation of Sturmian words, along Hardy field sequences, which are a far-reaching generalisation of Piatetski--Shapiro sequences $\lfloor n^c \rfloor$. We show that thus obtained…
A generalized quadrangle is a point-line incidence geometry such that any two points lie on at most one line and, given a line $\ell$ and a point $P$ not incident with $\ell$, there is a unique point of $\ell$ collinear with $P$. We study…
We design a deterministic subexponential time algorithm that takes as input a multivariate polynomial $f$ computed by a constant-depth circuit over rational numbers, and outputs a list $L$ of circuits (of unbounded depth and possibly with…
We have discussed earlier the correlation functions of the random variables $\det(\la-X)$ in which $X$ is a random matrix. In particular the moments of the distribution of these random variables are universal functions, when measured in the…
In this note we prove a new result about (finite) multiplier sequences, i.e. linear operators acting diagonally in the standard monomial basis of R[x] and sending polynomials with all real roots to polynomials with all real roots. Namely,…
Categorical random variables are a common staple in machine learning methods and other applications across disciplines. Many times, correlation within categorical predictors exists, and has been noted to have an effect on various algorithm…
We establish new combinatorial transcendence criteria for continued fraction expansions. Let $\alpha = [0; a_1, a_2,...]$ be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
We prove that for any generic polynomial $f$ in two variables of degree $(d_1,d_2)$ over the rationals, for $p$ large enough the Newton slopes of the character power series $C_f^*(\chi_m,s)$ of $f$ at $p$ is independent of the choice of the…
Given a sequence of complex square matrices, $a_n$, consider the sequence of their partial products, defined by $p_n=p_{n-1}a_{n}$. What can be said about the asymptotics as $n\to\infty$ of the sequence $f(p_n)$, where $f$ is a continuous…
The goal of this article is to study some basic algebraic and combinatorial properties of "generalized $n$-series" over a commutative ring $R$, which are functions $s: \mathbf{Z}_{\geq 0} \to R$ satisfying a mild condition. A special…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
Introducing certain singularities, we generalize the class of one-dimensional stochastic differential equations with so-called generalized drift. Equations with generalized drift, well-known in the literature, possess a drift that is…
We provide fundamental results on positive solutions to parametrized systems of generalized polynomial $\textit{inequalities}$ (with real exponents and positive parameters), including generalized polynomial $\textit{equations}$. In doing…