arXiv subjects
Publications and source records attributed to Mate Matolcsi.
By constructing suitable nonnegative exponential sums we give upper bounds on the cardinality of any set $B_q$ in cyclic groups $\ZZ_q$ such that the difference set $B_q-B_q$ avoids cubic residues modulo $q$.
We apply an improvement of the Delsarte LP-bound to give a new proof of the non-existence of finite projective planes of order 6, and uniqueness of finite projective planes of order 7. The proof is computer aided, and it is also feasible to apply to higher orders like 8, 9 and, with further improvements, possibly 10 and 12.
In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{\sqrt{n}}$. Entries of $\pm \frac{1}{\sqrt{n}}$ correspond to Hadamard matrices, so the question of existence of flat orthogonal matrices can be viewed as a relaxation of the Hadamard problem.
For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinality of a set $B\subset \ZZ_p$ such that the difference set $B-B$ contains only quadratic residues. Namely, instead of the "trivial" bound $|B|\leq \sqrt{p}$ we prove $|B|\leq \sqrt{p}-1$, under suitable conditions on $p$. The new bound is valid for approximately three quarters of the primes $p=4k+1$.
We describe general connections between intersective properties of sets in Abelian groups and positive exponential sums. In particular, given a set $A$ the maximal size of a set whose difference set avoids $A$ will be related to positive exponential sums using frequencies from $A$.
This short note gives an upper bound on the measure of sets $A\subset [0,1]$ such that $x+y=3z$ has no solutions in $A$.
We use combinatorial and Fourier analytic arguments to prove various non-existence results on systems of real and complex unbiased Hadamard matrices. In particular, we prove that a complete system of complex mutually unbiased Hadamard matrices (MUHs) in any dimension $d$ cannot contain more than one real Hadamard matrix. We also give new proofs of several known structural results in low dimensions, for $d\le 6$.
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definitions to tackle this famous open problem which has been open for the last 10 years. Some preliminary results are also listed.
This is a survey about tiling by translation only and related questions and methods, especially those that have to do with Fourier Analysis.
We give an entirely new approach to the problem of mutually unbiased bases (MUBs), based on a Fourier analytic technique in additive combinatorics. The method provides a short and elegant generalization of the fact that there are at most $d+1$ MUBs in $\Co^d$. It may also yield a proof that no complete system of MUBs exists in some composite dimensions -- a long standing open problem.
We give a slight improvement of the best known lower bound for the supremum of autoconvolutions of nonnegative functions supported in a compact interval. Also, by means of explicit examples we disprove a long standing natural conjecture of Schinzel and Schmidt concerning the extremal function for such autoconvolutions.
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time polynomial in ${diam}(A)$. We also give heuristic algorithms to find all non-periodic tilings of a cyclic group $Z_N$. In particular we carry out a full classification of all non-periodic tilings of $Z_{144}$.
We extend Freiman's inequality on the cardinality of the sumset of a $d$ dimensional set. We consider different sets related by an inclusion of their convex hull, and one of them added possibly several times.
The aim of this paper is to prove a general version of Plünnecke's inequality. Namely, assume that for finite sets $A$, $B_1, ... B_k$ we have information on the size of the sumsets $A+B_{i_1}+... +B_{i_l}$ for all choices of indices $i_1, ... i_l.$ Then we prove the existence of a non-empty subset $X$ of $A$ such that we have `good control' over the size of the sumset $X+B_1+... +B_k$. As an application of this result we generalize an inequality of \cite{gymr} concerning the submultiplicativity of cardinalities of sumsets.
The Global Positioning System (GPS) provides an excellent educational example as to how the theory of general relativity is put into practice and becomes part of our everyday life. This paper gives a short and instructive derivation of an important formula used in the GPS, and is aimed at graduate students and general physicists. The theoretical background of the GPS (see \cite{ashby}) uses the Schwarzschild spacetime to deduce the {\it approximate} formula, $ds/dt\approx 1+V-\frac{|\vv|^2}{2}$, for the relation between the proper time rate $s$ of a satellite clock and the coordinate time rate $t$. Here $V$ is the gravitational potential at the position of the satellite and $\vv$ is its velocity (with light-speed being normalized as $c=1$). In this note we give a different derivation of this formula, {\it without using approximations}, to arrive at $ds/dt=\sqrt{1+2V-|\vv|^2 -\frac{2V}{1+2V}(\n\cdot\vv)^2}$, where $\n$ is the normal vector pointing outward from the center of Earth to the satellite. In particular, if the satellite moves along a circular orbit then the formula simplifies to $ds/dt=\sqrt{1+2V-|\vv|^2}$. We emphasize that this derivation is useful mainly for educational purposes, as the approximation above is already satisfactory in practice.
For finite sets of integers $A_1, A_2 ... A_n$ we study the cardinality of the $n$-fold sumset $A_1+... +A_n$ compared to those of $n-1$-fold sumsets $A_1+... +A_{i-1}+A_{i+1}+... A_n$. We prove a superadditivity and a submultiplicativity property for these quantities. We also examine the case when the addition of elements is restricted to an addition graph between the sets.
A new construction for the form sum of positive, selfadjoint operators is given in this paper. The situation is a bit more general, because our aim is to add positive, symmetric operators. With the help of the used method, some commutation properties of the form sum extension are observed.
The first representation theorem establishes a correspondence between positive, self-adjoint operators and closed, positive forms on Hilbert spaces. The aim of this paper is to show that some of the results remain true if the underlying space is a reflexive Banach space. In particular, the construction of the Friedrichs extension and the form sum of positive operators can be carried over to this case.