Related papers: The range of non-linear natural polynomials cannot…

Let $\mathbb{F}_{q}$ be the finite field of characteristic $p$ containing $q = p^{r}$ elements and $f(x)=ax^{n} + x^{m}$ a binomial with coefficients in this field. If some conditions on the gcd of $n-m$ an $q-1$ are satisfied then this…

We show that the intersection of the irreducible components of a hypersurface defined by a polynomial with square-free support has F-rational singularities in characteristic $p>0$. As a consequence, we obtain that hypersurfaces defined by…

Neural networks for natural language reasoning have largely focused on extractive, fact-based question-answering (QA) and common-sense inference. However, it is also crucial to understand the extent to which neural networks can perform…

Many current NLP systems are built from language models trained to optimize unsupervised objectives on large amounts of raw text. Under what conditions might such a procedure acquire meaning? Our systematic experiments with synthetic data…

A number field $K$ is called \emph{monogenic} if its ring of integers $\mathbb{Z}_K$ can be expressed as a simple ring extension $\mathbb{Z}[\alpha]$ for some $\alpha \in \mathbb{Z}_K$. A monic irreducible polynomial $f(x)\in\mathbb{Z}[x]$…

In this paper we prove that the property of being scattered for a $\mathbb{F}_q$-linearized polynomial of small $q$-degree over a finite field $\mathbb{F}_{q^n}$ is unstable, in the sense that, whenever the corresponding linear set has at…

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.

We show that, if a sequence of non-zero polynomials in $\mathbb{Z}[X_1,X_2]$ take small values at translates of a fixed point $(\xi,\eta)$ by multiples of a fixed rational point within the group $\mathbb{C}\times\mathbb{C}^*$, then $\xi$…

We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L' included in L which has the same Parikh (commutative) image as L. Bounded…

Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…

A modal logic is \emph{non-iterative} if it can be defined by axioms that do not nest modal operators, and \emph{rank-1} if additionally all propositional variables in axioms are in scope of a modal operator. It is known that every…

Let $F$ be a non-singular homogeneous polynomial of degree $d$ in $n$ variables. We give an asymptotic formula of the pairs of integer points $(\mathbf x, \mathbf y)$ with $|\mathbf x| \le X$ and $|\mathbf y| \le Y$ which generate a line…

A finitely generated group $G$ is called poly-context-free if its word problem $\mathrm{WP}(G)$ is an intersection of finitely many context-free languages. We consider the quaternionic lattices $\Gamma_\tau$ over the field…

We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than $\omega^2$, then its order type is effectively computable.

A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where "subword" means "subsequence". A language is bifix-free if it is…

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

A linearized polynomial over $\mathbb F_{q^n}$ is called scattered when for any $t,x\in\mathbb F_{q^n}$, the condition $xf(t)-tf(x)=0$ holds if and only if $x$ and $t$ are $\mathbb F_q$-linearly dependent. General conditions for linearized…

The work investigates the problem of whether a context-free language is a subset of a group language. A.~V. Anisimov has shown that the problem of determining the unambiguity of finite automata is a special case of this problem. Then the…

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…