English
Related papers

Related papers: Finding normal bases over finite fields with presc…

200 papers

An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…

Numerical Analysis · Mathematics 2015-05-05 Vahagn Vardanyan

The standard formulation of a massive Abelian vector field in $2+1$ dimensions involves a Maxwell kinetic term plus a Chern-Simons mass term; in its place we consider a Chern-Simons kinetic term plus a Stuekelberg mass term. In this latter…

High Energy Physics - Theory · Physics 2009-10-28 F. A. Dilkes , D. G. C. McKeon

A meromorphic differential on a Riemann surface is said to be {\it real-normalized} if all its periods are real. Real-normalized differentials on Riemann surfaces of given genus with prescribed orders of their poles form real orbifolds…

Algebraic Geometry · Mathematics 2021-03-31 Igor Krichever , Sergei Lando , Alexandra Skripchenko

Suppose that $\lambda=\lambda^{<\lambda} \ge\aleph_0$, and we are considering a theory $T$. We give a criterion on $T$ which is sufficient for the consistent existence of $\lambda^{++}$ universal models of $T$ of size $\lambda^+$ for models…

Logic · Mathematics 2009-09-25 Mirna Džamonja , Saharon Shelah

A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…

Combinatorics · Mathematics 2017-06-12 Dan Archdeacon , Matt DeVos , Stefan Hannie , Bojan Mohar

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

Logic · Mathematics 2026-02-06 Anand Pillay , Atticus Stonestrom

Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…

Number Theory · Mathematics 2015-06-26 R. de la Breteche , T. D. Browning

A graph $G$ is called universal for a family of graphs $\mathcal{F}$ if it contains every element $F \in \mathcal{F}$ as a subgraph. Let $\mathcal{F}(n,2)$ be the family of all graphs with maximum degree $2$. Ferber, Kronenberg, and Luh…

Combinatorics · Mathematics 2019-02-19 Olaf Parczyk

In this paper, we give the following result: If $D$ is a digraph of order $n$, and if $d_{D}^{+}(u) + d_{D}^{-}(v) \ge n$ for every two distinct vertices $u$ and $v$ with $(u, v) \notin A(D)$, then $D$ has a directed $2$-factor with exactly…

Combinatorics · Mathematics 2017-08-03 Shuya Chiba , Tomoki Yamashita

We develop a criterion for a normal basis, and prove that the singular values of certain Siegel functions form normal bases of ray class fields over imaginary quadratic fields other than $\mathbb{Q}(\sqrt{-1})$ and $\mathbb{Q}(\sqrt{-3})$.…

Number Theory · Mathematics 2011-01-18 Ho Yung Jung , Ja Kyung Koo , Dong Hwa Shin

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…

Information Theory · Computer Science 2019-05-28 Kwang Ho Kim , Jong Hyok Choe , Dok Nam Lee , Dae Song Go , Sihem Mesnager

In combinatorial group testing problems Questioner needs to find a special element $x \in [n]$ by testing subsets of $[n]$. Tapolcai et al. introduced a new model, where each element knows the answer for those queries that contain it and…

Discrete Mathematics · Computer Science 2018-01-29 Dániel Gerbner , Máté Vizer

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

Number Theory · Mathematics 2025-10-10 Magdaléna Tinková , Pavlo Yatsyna

Let A be an n by n matrix with determinant 1. We show that for all n > 2 there exist dimensional strictly positive constants C_n such that the average over the orthogonal group of log rho(A X) d X > C_n log ||A||, where ||A|| denotes the…

Dynamical Systems · Mathematics 2007-05-23 Igor Rivin

We show that every $(2^n,2^n,2^n,1)$-relative difference set $D$ in $\Z_4^n$ relative to $\Z_2^n$ can be represented by a polynomial $f(x)\in \F_{2^n}[x]$, where $f(x+a)+f(x)+xa$ is a permutation for each nonzero $a$. We call such an $f$ a…

Combinatorics · Mathematics 2013-04-16 Yue Zhou

We derive the explicit form of eigenvectors of selfadjoint extension $H_\xi$, parametrized by $\xi \in \langle 0,\pi),$ of differential expression $ H=-\frac{d^2 }{d x^2} + \frac{x^2 }{4}$ together with the spectrum $\sigma(H_\xi)$ on the…

Functional Analysis · Mathematics 2021-02-16 Goce Chadzitaskos , Miloslav Havlíček , Jiří Patera

A result of A. Joseph says that any nilpotent or semisimple element $z$ in the Weyl algebra $A_1$ over some algebracally closed field $K$ of characterstic 0 has a normal form up to the action of the automorphism group of $A_1$. It is shown…

Rings and Algebras · Mathematics 2024-07-17 Gang Han , Zhennan Pan , Yulin Chen

We prove the existence of two thresholds regarding the compilability of random 2-CNF formulas to OBDDs. The formulas are drawn from $\mathcal{F}_2(n,\delta n)$, the uniform distribution over all 2-CNFs with $\delta n$ clauses and $n$…

Data Structures and Algorithms · Computer Science 2026-05-20 Alexis de Colnet , Alfons Laarman , Joon Hyung Lee

Let $\mathbb {F}_q$ be finite field with $q$ elements. Let $\alpha\leqslant n$ be positive integers. Consider the general linear group $\mathrm{GL}(\alpha+n, \mathbb {F}_q) $ and its subgroup $H(n)$, which fixes the first $\alpha$ basis…

Representation Theory · Mathematics 2025-08-25 Yury A. Neretin

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

Combinatorics · Mathematics 2012-07-09 Bill Jackson , J. C. Owen