Related papers: On generalized Sidon spaces
We show that every multilinear map between Euclidean spaces induces a unique, continuous, Minkowski multilinear map of the corresponding real cones of zonoids. Applied to the wedge product of the exterior algebra of a Euclidean space, this…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…
In 1994, J.Cobb described a Cantor set in $\mathbb{R}^3$ each of whose projections into 2-planes is one-dimensional. A series of works by other authors developing this field followed. We present another very simple series of Cantor sets in…
Cyclic orbit codes are constant dimension subspace codes that arise as the orbit of a cyclic subgroup of the general linear group acting on subspaces in the given ambient space. With the aid of the largest subfield over which the given…
We introduce a high-dimensional cubical complex, for any dimension t>0, and apply it to the design of quantum locally testable codes. Our complex is a natural generalization of the constructions by Panteleev and Kalachev and by Dinur et. al…
We extend the construction of Garsia-Rodemich spaces in different directions. We show that the new space \textbf{B,} introduced by Bourgain-Brezis-Mironescu \cite{bbm}, can be described via a suitable scaling of the Garsia-Rodemich norms.…
``An orbifold is a space which is locally modeled on the quotient of a vector space by a finite group.'' This sentence is so easily said or written that more than one person has missed some of the subtleties hidden by orbifolds. Orbifolds…
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…
Let G be a group acting isometrically with discrete orbits on a separable complete CAT(0)-space of bounded topological dimension. Under certain conditions, we give upper bounds for the Bredon cohomological dimension of G for the families of…
Every ordered collection of sets in Euclidean space can be associated to a combinatorial code, which records the regions cut out by the sets in space. Given two ordered collections of sets, one can form a third collection in which the…
Molodstov[10] introduced soft set theory as a new mathematical approach for solving problems having uncertainties. Many researchers worked on the findings of structures of soft set theory and applied to many problems having uncertainties.…
We show that cyclic products of projections onto convex subsets of Hadamard spaces can behave in a more complicated way than in Hilbert spaces, resolving a problem formulated by Miroslav Ba\v{c}\'ak. Namely, we construct an example of…
Generalized concatenated codes were introduced in the 1970s by Zinoviev. There are many types of codes in the literature that are known by other names that can be viewed as generalized concatenated codes. Examples include matrix-product…
We initiate systematic study of EZ-structures (and associated boundaries) of groups acting on spaces that admit consistent and conical (equivalently, consistent and convex) geodesic bicombings. Such spaces recently drew a lot of attention…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…
Subspace codes are the $q$-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In…
We develop by example a type of index theory for non-Fredholm operators. A general framework using cyclic homology for this notion of index was introduced in a separate article [CaKa13] where it may be seen to generalise earlier ideas of…
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and…