English
Related papers

Related papers: Involutions, Trace Maps, and Pseudorandom Numbers

200 papers

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , J. Maurice Rojas

Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…

Probability · Mathematics 2019-02-05 Klemens Taglieber , Uta Freiberg

Numerical semigroups are cofinite additive submonoids of the natural numbers. In 2011, Keith and Nath illustrated an injection from numerical semigroups to integer partitions. We explore this connection between partitions and numerical…

Combinatorics · Mathematics 2023-02-17 Hannah E. Burson , Hayan Nam , Simone Sisneros-Thiry

Let $n$ be a positive integer and let $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $q$ is a power of a prime. This paper introduces a natural action of the Projective Semilinear Group $\text{P}\Gamma \text{L}(2,…

Number Theory · Mathematics 2018-12-24 F. E. Brochero Martínez , Daniela Oliveira , Lucas Reis

Inversion of various inclusions, that characterize continuity in topological spaces, results in numerous variants of quotient and perfect maps. In the framework of convergences, the said inclusions are no longer equivalent, and each of them…

General Topology · Mathematics 2020-06-18 Szymon Dolecki

The QCDNUM program numerically solves the evolution equations for parton densities and fragmentation functions in perturbative QCD. Un-polarised parton densities can be evolved up to next-to-next-to-leading order in powers of the strong…

High Energy Physics - Phenomenology · Physics 2010-11-23 M. Botje

The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…

Combinatorics · Mathematics 2016-03-25 David Ellerman

The goal of this work is to decompose random populations with a genealogy in subfamilies of a given degree of kinship and to obtain a notion of infinitely divisible genealogies. We model the genealogical structure of a population by…

Probability · Mathematics 2019-04-09 Patrick Gloede , Andreas Greven , Thomas Rippl

We explore how the asymptotic structure of a random $n$-term weak integer composition of $m$ evolves, as $m$ increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These…

Combinatorics · Mathematics 2024-12-20 David Bevan , Dan Threlfall

We study shadowing property for random infinite pseudotrajectories of a continuous map $f$ of a compact metric space. For the cases of transitive maps and transitive attractors we prove a dichotomy: either $f$ satisfies shadowing property…

Dynamical Systems · Mathematics 2016-06-27 Sergey Tikhomirov

In this paper we find exact formulas for the numbers of partitions and compositions of an element into $m$ parts over a finite field, i.e. we find the number of nonzero solutions of the equation $x_1+x_2+...+x_m=z$ over a finite field when…

Combinatorics · Mathematics 2012-05-22 Amela Muratović-Ribić , Qiang Wang

In this note we study order reversing quasi involutions and their properties. These maps are dualities (order reversing involutions) on their image. We prove that any order reversing quasi involution is induced by a cost. Invariant sets of…

Metric Geometry · Mathematics 2022-11-07 Shiri Artstein-Avidan , Shay Sadovsky , Katarzyna Wyczesany

We define a $q$-deformation of the classical ring of integer-valued polynomials which we call the ring of quantum integer-valued polynomials. We show that this ring has a remarkable combinatorial structure and enjoys many positivity…

Rings and Algebras · Mathematics 2019-12-24 Nate Harman , Sam Hopkins

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

Number Theory · Mathematics 2007-05-23 Igor Rivin

Entanglement is a quantum resource, in some ways analogous to randomness in classical computation. Inspired by recent work of Gheorghiu and Hoban, we define the notion of "pseudoentanglement'', a property exhibited by ensembles of…

We first observe a mysterious similarity between the braid arrangement and the arrangement of all hyperplanes in a vector space over the finite field $\mathbb{F}_q$. These two arrangements are defined by the determinants of the Vandermonde…

Combinatorics · Mathematics 2025-04-08 Tongyu Nian , Shuhei Tsujie , Ryo Uchiumi , Masahiko Yoshinaga

We introduce the notion of a field of covariances, a contravariant functor from non-commutative probability spaces to Hilbert spaces, as the natural categorical analogue of statistical covariance. In the case of finite-dimensional…

Mathematical Physics · Physics 2025-10-29 Florio M. Ciaglia , Fabio Di Cosmo , Laura González-Bravo

This paper investigates the algebraic and graphical structure of the ring $\mathbb{Z}_{sp}$, with a focus on its decomposition into finite fields, kernels, and special subsets. We establish classical isomorphisms between $\mathbb{F}_s$ and…

Cryptography and Security · Computer Science 2025-10-20 Nikolaos Verykios , Christos Gogos

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

Symbolic Computation · Computer Science 2020-01-07 Ludovic Brieulle , Luca De Feo , Javad Doliskani , Jean-Pierre Flori , Éric Schost

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen