Related papers: Addendum to "Fuglede's conjecture fails in 4 dimen…

The Fuglede conjecture states that a set is spectral if and only if it tiles by translation. The conjecture was disproved by T. Tao for dimensions 5 and higher by giving a counterexample in $\mathbb{Z}_3^5$. We present a computer program…

Fuglede's conjecture in $\mathbb{Z}_{p}^{d}$, $p$ a prime, says that a subset $E$ tiles $\mathbb{Z}_{p}^{d}$ by translation if and only if $E$ is spectral, meaning any complex-valued function $f$ on $E$ can be written as a linear…

We give an example of a set $\Omega \subset \R^5$ which is a finite union of unit cubes, such that $L^2(\Omega)$ admits an orthonormal basis of exponentials $\{\frac{1}{|\Omega|^{1/2}} e^{2\pi i \xi_j \cdot x}: \xi_j \in \Lambda \}$ for…

In this short note we construct a spectral, non-tiling set of size $2p$ in $(\mathbb{Z}/p\mathbb{Z})^4$, $p$ odd prime. This example complements a previous counterexample in [arXiv:1509.01090], which existed only for $p \equiv 3 \pmod{4}$.…

We study tiling and spectral sets in vector spaces over prime fields. The classical Fuglede conjecture in locally compact abelian groups says that a set is spectral if and only if it tiles by translation. This conjecture was disproved by T.…

We give non-torsion counterexamples against the integral Tate conjecture for finite fields. We extend the result due to Pirutka and Yagita for prime numbers 2,3,5 to all prime numbers.

In this paper, we prove the cohomological Lichtenbaum conjecture of abelian extensions of imaginary quadratic fields up to a finite set of bad primes.

We present an approach to Fuglede's conjecture in $\mathbb{Z}_p^3$ using linear programming bounds, obtaining the following partial result: if $A\subseteq\mathbb{Z}_p^3$ with $p^2-p\sqrt{p}+\sqrt{p}<|A|<p^2$, then $A$ is not spectral.

We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…

Paul Erdos claimed that mathematics is not yet ready to settle the 3x+1 conjecture. I agree, but very soon it will be! With the exponential growth of computer-generated mathematics, we (or rather our silicon brethrern) would have a shot at…

We describe some recent computer investigations with the `Constraint Logic Programming over Finite Domains' -- CLP(FD) -- library in the Prolog programming environment to search for new simple Lie algebras over the field $\GF(2)$ of $2$…

In this note we give an example of a set $\W\subset \R^4$ such that $L^2(\W)$ admits an orthonormal basis of exponentials $\{\frac{1}{|\W |^{1/2}}e^{2\pi i x, \xi}\}_{\xi\in\L}$ for some set $\L\subset\R^4$, but which does not tile $\R^4$…

We describe the implementation of a subfield of the field of formal Puiseux series in polymake. This is employed for solving linear programs and computing convex hulls depending on a real parameter. Moreover, this approach is also useful…

This document serves as an arXiv entry point for the appendix to the paper [13] (the ancillary file e6_proof.pdf -- ``Proof of the tree module property for exceptional representations of the quiver $\widetilde{\mathbb{E}}_6$'') and the…

We study the extension estimates for paraboloids in d-dimensional vector spaces over finite fields F_q with q elements. We use the connection between L^2 based restriction estimates and L^p\to L^r extension estimates for paraboloids. As a…

We prove some new instances of a conjecture of Bachoc, Couvreur and Z\'emor that generalizes Freiman's $3k-4$ Theorem to a multiplicative version in a function field setting. As a consequence we find that if $F$ is a rational function field…

Let $\Omega\subset \mathbb{R}^d$ be a set of finite measure. The periodic tiling conjecture suggests that if $\Omega$ tiles $\mathbb{R}^d$ by translations then it admits at least one periodic tiling. Fuglede's conjecture suggests that…

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…

We study the following two-parameter variant of the Erd\H os-Falconer distance problem. Given $E,F \subset {\Bbb F}_q^{k+l}$, $l \geq k \ge 2$, the $k+l$-dimensional vector space over the finite field with $q$ elements, let $B_{k,l}(E,F)$…