Related papers: Weighted enumeration of number fields using Pseudo…

A property $\Pi$ on a finite set $U$ is \emph{monotone} if for every $X \subseteq U$ satisfying $\Pi$, every superset $Y \subseteq U$ of $X$ also satisfies $\Pi$. Many combinatorial properties can be seen as monotone properties. The problem…

This paper considers the problem of minimizing the ordered weighted average (or ordered median) function of finitely many rational functions over compact semi-algebraic sets. Ordered weighted averages of rational functions are not, in…

In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…

In this paper, we mainly give a general explicit form of Cassels' $p$-adic embedding theorem for number fields. We also give its refined form in the case of cyclotomic fields. As a byproduct, given an irreducible polynomial $f$ over $Z$, we…

Scattered polynomials over finite fields attracted an increasing attention in the last years. One of the reasons is their deep connection with Maximum Rank Distance (MRD) codes. Known classification results for exceptional scattered…

We consider the SUBSET SUM problem and its important variants in this paper. In the SUBSET SUM problem, a (multi-)set $X$ of $n$ positive numbers and a target number $t$ are given, and the task is to find a subset of $X$ with the maximal…

For a finite set of natural numbers $D$ consider a complex polynomial of the form $f(z) = \sum_{d \in D} c_d z^d$. Let $\rho_+(f)$ and $\rho_-(f)$ be the fractions of the unit circle that $f$ sends to the right($\operatorname{Re} f(z) > 0$)…

Let $G$ be a finite group of order $n$, and denote by $\rho(G)$ the product of element orders of $G$. The aim of this work is to provide some upper bounds for $\rho(G)$ depending only on $n$ and on its least prime divisor, when $G$ belongs…

Denote by s_F(n) the minimal number of Fibonacci numbers needed to write n as a sum of Fibonacci numbers. We obtain the extremal minimal and maximal orders of magnitude of s_F(n^h)/s_F(n) for any h>= 2. We use this to show that for all…

Tensors are ubiquitous in science and engineering and tensor factorization approaches have become important tools for the characterization of higher order structure. Factorizations includes the outer-product rank Canonical Polyadic…

The proper Class $\bf{No}$ of all Conway's numbers $\cite{l3}$ is considered as a region of investigation. It turns out to be a total ordered Field (i.e., a field whose domain is a proper Class) and this totally, or linear ordered Class,…

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

A frame template over a field $\mathbb F$ describes the precise way in which a given $\mathbb F$-representable matroid is close to being a frame matroid. Our main result determines the maximum-rank projective or affine geometry that is…

C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…

Let $\rho: SL(2,\mathbb{Z})\to GL(2,\mathbb{C})$ be an irreducible representation of the modular group such that $\rho(T)$ has finite order $N$. We study holomorphic vector-valued modular forms $F(\tau)$ of integral weight associated to…

We show that the theory of algebraically closed fields with multiplicative circular orders has a model companion $\mathrm{ACFO}$. Using number-theoretic results on character sums over finite fields, we show that if $\mathbb{F}$ is an…

Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semirings studied in algebra. Here, we define polynomials over a…

We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

A tensor defined over a finite field $\mathbb{F}$ has low analytic rank if the distribution of its values differs significantly from the uniform distribution. An order $d$ tensor has partition rank 1 if it can be written as a product of two…