English
Related papers

Related papers: New Nikodym set constructions over finite fields

200 papers

Let $d\ge3$ and $\mathbb{F}_q^{\,d}$ be the $d$-dimensional vector space over a finite field of order $q$, where $q$ is an odd prime power. Let $X_\pi$ be the set of lines through the origin intersecting the slice $\pi\cap S^{d-1}$, where…

Combinatorics · Mathematics 2025-12-12 Le Quang Ham , Do Trong Hoang , Le Quang Hung , Doowon Koh , Thang Pham

Let $\mathbb F_2^n$ be the finite field of cardinality $2 ^{n}$. For all large $n$, any subset $A\subset \mathbb F_2^n\times \mathbb F_2 ^n$ of cardinality \begin{equation*} \abs{A} \gtrsim 4^n \log\log n (\log n) ^{-1} \end{equation*} must…

Combinatorics · Mathematics 2007-05-23 Michael T Lacey , William McClain

In this paper, the first family of conforming finite element divdiv complexes on cuboid grids in three dimensions is constructed. Besides, a new family of conforming finite element divdiv complexes with enhanced smoothness on tetrahedral…

Numerical Analysis · Mathematics 2022-04-19 Jun Hu , Yizhou Liang , Rui Ma , Min Zhang

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

Functional Analysis · Mathematics 2019-10-03 Colin C. Graham

We present a variety of prime-generating constructions that are based on sums of primes. The constructions come in all shapes and sizes, varying in the number of dimensions and number of generated primes. Our best result is a construction…

History and Overview · Mathematics 2017-03-28 Dmitry Kamenetsky

It is known that in the lattice of normal extensions of the logic KTB there are unique logics of codimensions 1 and 2, namely, the logic of a single reflexive point, and the logic of the total relation on two points. A natural question…

Logic · Mathematics 2021-10-19 James Koussas , Tomasz Kowalski , Yutaka Miyazaki , Michael Stevens

A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…

Combinatorics · Mathematics 2023-05-25 Noga Alon , Anurag Bishnoi , Shagnik Das , Alessandro Neri

For a Dickson pair $(q,n)$ we show that $ \big \lbrace \frac{q^k-1}{q-1}, 1 \leq k < n \big \rbrace $ forms a finite complete set of different residues modulo $n$. We also study the construction of a finite Dickson nearfield that arises…

Number Theory · Mathematics 2023-05-12 Prudence Djagba

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let ${a_1,\ldots,a_r}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…

Number Theory · Mathematics 2016-02-23 Mikhail Gabdullin

For problems relating to fracture, a consistent embedding of a quantum (QM) domain in its classical (CM) environment requires that the classical system should yield the same structure and elastic properties as the QM domain for states near…

Computational Physics · Physics 2007-05-23 Aditi Mallik , Keith Runge , Hai-Ping Cheng , James W. Dufty

Let $\mathbb F_q^d$ be the $d$-dimensional vector space over the finite field $\mathbb F_q$ with $q$ elements. For each non-zero $r$ in $\mathbb F_q$ and $E\subset \mathbb F_q^d$, we define $W(r)$ as the number of quadruples $(x,y,z,w)\in…

Number Theory · Mathematics 2023-09-06 Alex Iosevich , Doowon Koh , Firdavs Rakhmonov

We consider Ribenboim's construction of rings of generalized power series. Ribenboim's construction makes use of a special class of partially ordered monoids and a special class of their subsets. While the restrictions he imposes might seem…

Category Theory · Mathematics 2018-05-28 Richard Blute , Robin Cockett , Pierre-Alain Jacqmin , Philip Scott

We present a complete set of rewrite rules for n-qutrit Clifford circuits where n is any non-negative integer. This is the first completeness result for any fragment of quantum circuits in odd prime dimensions. We first generalize…

Logic in Computer Science · Computer Science 2025-08-25 Sarah Meng Li , Michele Mosca , Neil J. Ross , John van de Wetering , Yuming Zhao

If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.

Combinatorics · Mathematics 2018-10-16 William M. Kantor

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

Logic · Mathematics 2018-10-26 John Krueger

We prove that a map onto a nilpotent group $Q$ has finitely generated kernel if and only if the preimage of the positive cone is coarsely connected as a subset of the Cayley graph for every full archimedean partial order on $Q$. In case $Q$…

Group Theory · Mathematics 2023-11-02 Kevin Klinge

In this paper, we propose a general construction of linear perfect codes over infinite skew fields and quasi skew fields with right (left) unity. A complete classification of such codes over associative skew fields is given. Since the…

Information Theory · Computer Science 2022-12-09 Sergei A. Malyugin

We construct 2D and 3D finite element de Rham sequences of arbitrary polynomial degrees with extra smoothness. Some of these elements have nodal degrees of freedom (DoFs) and can be considered as generalisations of scalar Hermite and…

Numerical Analysis · Mathematics 2017-12-19 Snorre H. Christiansen , Jun Hu , Kaibo Hu

Rigged configurations are combinatorial objects originating from the Bethe Ansatz, that label highest weight crystal elements. In this paper a new unrestricted set of rigged configurations is introduced for types ADE by constructing a…

Quantum Algebra · Mathematics 2007-10-08 Anne Schilling

Let $L=(L_d)_{d \in \mathbb N}$ be any ordered probability sequence, i.e., satisfying $0 < L_{d+1} \le L_d$ for each $d \in \mathbb N$ and $\sum_{d \in \mathbb N} L_d =1$. We construct sequences $A = (a_i)_{i \in \mathbb N}$ on the…

Number Theory · Mathematics 2024-02-23 Aafko Boonstra , Charlene Kalle