English
Related papers

Related papers: Elementary characters on semigroups: the rational …

200 papers

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

The determinant for complex matrices cannot be extended to quaternionic matrices. Instead, the Study determinant and the closely related $q$-determinant are widely used. We show that the Study determinant can be characterized as the unique…

Mathematical Physics · Physics 2007-05-23 Nir Cohen , Stefano De Leo

The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…

Representation Theory · Mathematics 2018-10-03 Farid Aliniaeifard , Nathaniel Thiem

The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…

Number Theory · Mathematics 2007-05-23 Vinay Deolalikar

The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…

Optimization and Control · Mathematics 2022-10-21 Pavel Chebotarev

Given any square matrix or a bounded operator $A$ in a Hilbert space such that $p(A)$ is normal (or similar to normal), we construct a Banach algebra, depending on the polynomial $p$, for which a simple functional calculus holds. When the…

Functional Analysis · Mathematics 2015-06-03 Olavi Nevanlinna

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

Information Theory · Computer Science 2022-12-12 Yue Yu , Pavel Loskot

We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…

Number Theory · Mathematics 2025-11-12 Przemysław Koprowski

Character expansion is introduced and explicitly constructed for the (non-colored) HOMFLY polynomials of the simplest knots. Expansion coefficients are not the knot invariants and can depend on the choice of the braid realization. However,…

Quantum Algebra · Mathematics 2015-06-03 A. Mironov , A. Morozov , An. Morozov

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.

Number Theory · Mathematics 2022-07-19 Bhawesh Mishra

We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…

Number Theory · Mathematics 2018-09-05 Marley Young

The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also known as finite differences. In the framework of ordinary…

Computational Complexity · Computer Science 2022-11-17 Manon Blanc , Olivier Bournez

A definition is offered of the factorial characters of the general linear group, the symplectic group and the orthogonal group in an odd dimensional space. It is shown that these characters satisfy certain flagged Jacobi-Trudi identities.…

Combinatorics · Mathematics 2016-07-26 Angèle Hamel , Ronald King

We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…

Representation Theory · Mathematics 2015-09-24 Qimh Richey Xantcha

We obtain a measure theoretical characterization of polynomials among rational functions on $\mathbb{P}^1$, which generalizes a theorem of Lopes. Our proof applies both classical and dynamically weighted potential theory.

Complex Variables · Mathematics 2012-10-19 Yûsuke Okuyama , Małgorzata Stawiska

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

Machine Learning · Computer Science 2019-10-23 Roozbeh Farhoodi , Khashayar Filom , Ilenna Simone Jones , Konrad Paul Kording

A recent result of Cohen and Zemel provides an elegant expansion of the Rasala polynomials for symmetric group character degrees. In this note we present an alternative short algebraic proof. Extensions to polynomials of character values…

Combinatorics · Mathematics 2025-09-17 Yuval Roichman

A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regular, i.e. it can be computed by a deterministic two-way…

Formal Languages and Automata Theory · Computer Science 2022-11-04 Olivier Carton , Gaëtan Douéneau-Tabot

We prove an analog of the Tits alternative for rational functions. In particular, we show that if $S$ is a finitely generated semigroup of rational functions over the complex numbers, then either $S$ has polynomially bounded growth or $S$…

Number Theory · Mathematics 2021-03-19 Jason P. Bell , Keping Huang , Wayne Peng , Thomas J. Tucker

In this paper, we introduce a new family of argument-ranking semantics which can be seen as a refinement of the classification of arguments into skeptically accepted, credulously accepted and rejected. To this end we use so-called social…

Artificial Intelligence · Computer Science 2024-12-19 Lars Bengel , Giovanni Buraglio , Jan Maly , Kenneth Skiba