Related papers: Combinatorial polarization, code loops, and codes …
Intersecting codes are linear codes where every two nonzero codewords have non-trivially intersecting support. In this article we expand on the theory of this family of codes, by showing that nondegenerate intersecting codes correspond to…
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…
We give a complete combinatorial characterization of all possible polarizations of powers of the graded maximal ideal $(x_1,x_2,\cdots,x_m)^n$ of a polynomial ring in $m$ variables. We also give a combinatorial description of the Alexander…
The polarization constant of a Banach space $X$ is defined as $$\mathbf c(X):= \limsup\limits_{k\rightarrow \infty} \mathbf c(k, X)^\frac{1}{k},$$ where $\mathbf c(k, X)$ stands for the best constant $C>0$ such that $ \Vert…
Higher order calculations in perturbative Quantum Field Theories often produce coupled linear systems of differential equations which factorize to first order. Here we present an algorithm to solve such systems in terms of iterated…
We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…
Affine Cartesian codes are defined by evaluating multivariate polynomials at a cartesian product of finite subsets of a finite field. In this work we examine properties of these codes as batch codes. We consider the recovery sets to be…
Let $X$, $Y$ be sets and let $\Phi$, $\Psi$ be mappings with domains $X^{2}$ and $Y^{2}$ respectively. We say that $\Phi$ and $\Psi$ are combinatorially similar if there are bijections $f \colon \Phi(X^2) \to \Psi(Y^{2})$ and $g \colon Y…
Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…
A concatenated coding scheme over binary memoryless symmetric (BMS) channels using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents and upper bounds on the error rate are derived. The first…
As starting point, we formulate a corollary to the Quantitative Combinatorial Nullstellensatz. This corollary does not require the consideration of any coefficients of polynomials, only evaluations of polynomial functions. In certain…
There is a nice combinatorial formula of P. Beelen and M. Datta for the $r$-th generalized Hamming weight of an affine cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the $r$-th generalized…
This is an expository paper which has two parts. In the first part, we study quiver varieties of affine $A$-type from a combinatorial point of view. We present a combinatorial method for obtaining a closed formula for the generating…
We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…
Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular,…
We introduce a family of periods of mixed Tate motives called dissection polylogarithms, that are indexed by combinatorial objects called dissection diagrams. The motivic coproduct on the former is encoded by a combinatorial Hopf algebra…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
We formulate code concatenation as the action of a unitary quantum circuit on an expanding tree geometry and find that for certain classes of gates, applied identically at each node, a binary tree circuit encodes a single logical qubit with…
Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.