English
Related papers

Related papers: Weighted enumeration of number fields using Pseudo…

200 papers

Higher derivative corrections are ubiquitous in effective field theories, which seemingly introduces new degrees of freedom at successive order. This is actually an artefact of the implicit local derivative expansion defining effective…

High Energy Physics - Theory · Physics 2024-07-30 Dražen Glavan

In this paper, I discuss two logics for weighted finite structures: first-order logic with summation (FO(SUM)) and its recursive extension IFP(SUM). These logics originate from foundational work by Gr\"adel, Gurevich, and Meer in the 1990s.…

Logic in Computer Science · Computer Science 2026-01-15 Martin Grohe

Given asymptotic counts in number theory, a question of Venkatesh asks what is the topological nature of lower order terms. We consider the arithmetic aspect of the inertia stack of an algebraic stack over finite fields to partially answer…

Algebraic Geometry · Mathematics 2023-05-09 Changho Han , Jun-Yong Park

We consider weighted structures, which extend ordinary relational structures by assigning weights, i.e. elements from a particular group or ring, to tuples present in the structure. We introduce an extension of first-order logic that allows…

Logic in Computer Science · Computer Science 2020-09-23 Steffen van Bergerem , Nicole Schweikardt

Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural multi-dimensional extension of the theorem of…

Number Theory · Mathematics 2023-09-12 Brian Cook , Ákos Magyar , Tatchai Titichetrakun

In this paper, we consider the construction of linear lexicodes over finite chain rings by using a $B$-ordering over these rings and a selection criterion. % and a greedy Algorithm. As examples we give lexicodes over $\mathbb{Z}_4$ and…

Information Theory · Computer Science 2015-03-20 Kenza Guenda , T. Aaron Gulliver , S. Arash Sheikholeslam

We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every $k$, the irreducible polynomials in $\mathbf{F}_q[t]$ contain configurations of the…

Number Theory · Mathematics 2009-09-02 Thai Hoang Le

We establish functional limit theorems for ergodic sums of observables with power singularities for expanding circle maps. In the regime where the observables have infinite variance, we show that when rescaled by $N^{1/s}(\ln N)^\alpha$,…

Dynamical Systems · Mathematics 2025-09-03 Dmitry Dolgopyat , Sixu Liu

Scattered polynomials of a given index over finite fields are intriguing rare objects with many connections within mathematics. Of particular interest are the exceptional ones, as defined in 2018 by the first author and Zhou, for which…

Information Theory · Computer Science 2021-10-18 Daniele Bartoli , Giovanni Zini , Ferdinando Zullo

In this paper, for every $\epsilon\in \mathbb{Z}$, we introduce an extension of the 2-toroidal Lie algebra by certain derivations. Based on the $\phi_\epsilon$-coordinated modules theory for vertex algebras, we give an explicit realization…

Quantum Algebra · Mathematics 2022-03-23 Fulin Chen , Huansheng Li , Nina Yu

Single scale Feynman integrals in quantum field theories obey difference or differential equations with respect to their discrete parameter $N$ or continuous parameter $x$. The analysis of these equations reveals to which order they…

High Energy Physics - Theory · Physics 2018-08-27 Johannes Blümlein

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…

Symbolic Computation · Computer Science 2011-11-08 Guillaume Chèze

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

Symbolic Computation · Computer Science 2011-01-04 Mark Giesbrecht , Daniel S. Roche , Hrushikesh Tilak

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

Logic · Mathematics 2021-11-02 Juvenal Murwanashyaka

We consider the problem of partial order production: arrange the elements of an unknown totally ordered set T into a target partially ordered set S, by comparing a minimum number of pairs in T. Special cases include sorting by comparisons,…

Data Structures and Algorithms · Computer Science 2010-05-06 Jean Cardinal , Samuel Fiorini , Gwenaël Joret , Raphaël M. Jungers , J. Ian Munro

Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$…

Fagin's seminal result characterizing $\mathsf{NP}$ in terms of existential second-order logic started the fruitful field of descriptive complexity theory. In recent years, there has been much interest in the investigation of quantitative…

Logic · Mathematics 2024-05-01 Guillermo Badia , Manfred Droste , Carles Noguera , Erik Paul

We first give a short intrinsic, diagrammatic proof of the First Fundamental Theorem of invariant theory (FFT) for the special orthogonal group $\text{SO}_m(\mathbb{C})$, given the FFT for $\text{O}_m(\mathbb{C})$. We then define, by means…

Representation Theory · Mathematics 2016-12-14 Gustav Lehrer , Ruibin Zhang

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh
‹ Prev 1 4 5 6 7 8 10 Next ›