English
Related papers

Related papers: Weighted enumeration of number fields using Pseudo…

200 papers

Let $\mathbb{D}$ be a division ring and $\mathbb{F}$ be a subfield of the center of $\mathbb{D}$ over which $\mathbb{D}$ has finite dimension $d$. Let $n,p,r$ be positive integers and $\mathcal{V}$ be an affine subspace of the…

Rings and Algebras · Mathematics 2015-04-09 Clément de Seguins Pazzis

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

Logic in Computer Science · Computer Science 2022-01-11 Thomas Colcombet , Sam van Gool , Rémi Morvan

We investigate the estimation of multivariate extreme models with a discrete spectral measure using spherical clustering techniques. The primary contribution involves devising a method for selecting the order, that is, the number of…

Methodology · Statistics 2025-02-20 Shiyuan Deng , He Tang , Shuyang Bai

Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of…

Number Theory · Mathematics 2013-08-20 Étienne Fouvry , Emmanuel Kowalski , Philippe Michel

We present a formula for the degree of the discriminant of irreducible representations of a Lie group, in terms of the roots of the group and the highest weight of the representation. The proof uses equivariant cohomology techniques,…

Algebraic Geometry · Mathematics 2007-08-22 L. M. Feher , A. Nemethi , R. Rimanyi

It was recently shown by van den Broeck at al. that the symmetric weighted first-order model counting problem (WFOMC) for sentences of two-variable logic FO2 is in polynomial time, while it is Sharp-P_1 complete for some FO3-sentences. We…

Logic in Computer Science · Computer Science 2018-04-27 Antti Kuusisto , Carsten Lutz

In the context of the Higher-Order Maxwell-Einstein-Scalar (HOMES) theories, which are invariant under spacetime diffeomorphisms and $U(1)$ gauge symmetry, we study two broad subclasses: the first is up to linear in $R_{\mu\nu\alpha\beta}$,…

High Energy Physics - Theory · Physics 2025-09-23 Mohammad Ali Gorji , Shinji Mukohyama , Pavel Petrov , Masahide Yamaguchi

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

Group Theory · Mathematics 2025-12-23 Zeev Dvir

A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…

Combinatorics · Mathematics 2013-06-28 Yangzhou Hu

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

Number Theory · Mathematics 2023-11-07 Alp Bassa , Gaetan Bisson , Roger Oyono

We introduce a new class of real-valued monotones in preordered spaces, injective monotones. We show that the class of preorders for which they exist lies in between the class of preorders with strict monotones and preorders with countable…

Information Theory · Computer Science 2022-08-18 Pedro Hack , Daniel A. Braun , Sebastian Gottwald

In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…

Data Structures and Algorithms · Computer Science 2015-03-17 Tobias Brunsch , Heiko Roeglin

We consider the task of weighted first-order model counting (WFOMC) used for probabilistic inference in the area of statistical relational learning. Given a formula $\phi$, domain size $n$ and a pair of weight functions, what is the…

Artificial Intelligence · Computer Science 2022-11-03 Jan Tóth , Ondřej Kuželka

The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…

Category Theory · Mathematics 2025-12-29 Takuo Matsuoka

We study a class of non-unitary so(2,d) representations (for even values of d), describing mixed-symmetry partially massless fields which constitute natural candidates for defining higher-spin singletons of higher order. It is shown that…

High Energy Physics - Theory · Physics 2018-05-16 Thomas Basile

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

General Mathematics · Mathematics 2019-12-30 Duggirala Meher Krishna , Duggirala Ravi

In this paper, all irreducible weight modules with finite dimensional weight spaces over the twisted Heisenberg-Virasoro algebra are determined. There are two different classes of them. One class is formed by simple modules of intermediate…

Representation Theory · Mathematics 2019-08-09 Rencai Lu , Kaiming Zhao

Fix a vector space over a finite field and a system of linear equations. We provide estimates, in terms of the dimension of the vector space, of the maximum of the sizes of subsets of the space that do not admit solutions of the system…

Combinatorics · Mathematics 2019-09-24 Masato Mimura , Norihide Tokushige

We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in…

Logic · Mathematics 2017-09-26 Milos S. Kurilic , Borisa Kuzeljevic

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…

Combinatorics · Mathematics 2020-05-19 Oliver Janzer