Related papers: Extensions of algebraic function fields with compl…
Let $\langle K,\nu \rangle$ be a real closed valued field, and let $S\subseteq K^n$ be an open semi-algebraic set. Using tools from model theory, we find an algebraic characterization of rational functions which admit, on $S$, only values…
We introduce and discuss a new class of (multivalued analytic) transcendental functions which still share with algebraic functions the property that the number of their isolated zeros can be explicitly counted. On the other hand, this class…
Motivated by a question in Schubert calculus, we study the interplay of quasisymmetric polynomials with the divided symmetrization operator, which was introduced by Postnikov in the context of volume polynomials of permutahedra. Divided…
In a recent paper with Sahi and Stokman, we introduced quasi-polynomial generalizations of Macdonald polynomials for arbitrary root systems via a new class of representations of the double affine Hecke algebra. These objects depend on a…
We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…
We analyze the abstract representations of the groups of rational points of even-dimensional quasi-split special unitary groups associated with quadratic field extensions. We show that, under certain assumptions, such representations have a…
In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…
We develop the basic theory of geometrically closed rings as a generalisation of algebraically closed fields, on the grounds of notions coming from positive model theory and affine algebraic geometry. For this purpose we consider several…
I examine quantum mechanical Hamiltonians with partial supersymmetry, and explore two main applications. First, I analyze a theory with a logarithmic spectrum, and show how to use partial supersymmetry to reveal the underlying structure of…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
We introduce a new method of constructing complete sequences of key polynomials for simple extensions of tame fields. In our approach the key polynomials are taken to be the minimal polynomials over the base field of suitably constructed…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
With a grading previously introduced by the second-named author, the multiplication maps in the preprojective algebra satisfy a maximal rank property that is similar to the maximal rank property proven by Hochster and Laksov for the…
We develop an elementary theory of partially additive rings as a foundation of ${\mathbb F}_1$-geometry. Our approach is so concrete that an analog of classical algebraic geometry is established very straightforwardly. As applications, (1)…
We establish a rigid-analytic analog of the Pila-Wilkie counting theorem, giving sub-polynomial upper bounds for the number of rational points in the transcendental part of a $\mathbb{Q}_p$-analytic set, and the number of rational functions…
In a recent joint paper with S. Sahi and V. Venkateswaran (2025), families of actions of the double affine Hecke algebra on spaces of quasi-polynomials were introduced. These so-called quasi-polynomial representations led to the…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…
We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…