Related papers: A Deterministic Dimension Property of Twisted Gopp…
In this paper we solve an open question formulated in the original paper of twisted skew group codes regarding when a twisted skew group code is checkable. Also, we prove that all ideals of dimension 3 over a twisted group algebra are…
We present a number models describing the sequential deposition of a mixture of particles whose size distribution is determined by the power-law $p(x) \sim \alpha x^{\alpha-1}$, $x\leq l$ . We explicitly obtain the scaling function in the…
We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted IDENTIFYING CODE, (OPEN) LOCATING-DOMINATING SET and METRIC DIMENSION) of an interval or a permutation graph. In…
A set W \subseteq V (G) is called a resolving set, if for each pair of distinct vertices u,v \in V (G) there exists t \in W such that d(u,t) \neq d(v,t), where d(x,y) is the distance between vertices x and y. The cardinality of a minimum…
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
A new homological dimension is introduced to measure the quality of resolutions of `singular' finite dimensional algebras (of infinite global dimension) by `regular' ones (of finite global dimension). Upper bounds are established in terms…
Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…
The relation between the girth and the guaranteed error correction capability of $\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable…
Twists are defects that are used to encode and process quantum information in topological codes like surface and color codes. Color codes can host three basic types of twists viz., charge-permuting, color-permuting and domino twists. In…
In this note, we investigate Goppa codes which are constructed by means of Elliptic function field and Hyperelliptic function field. We also give a simple criterion for self-duality of these codes.
A topological bifurcation in chaotic scattering is characterized by a sudden change in the topology of the infinite set of unstable periodic orbits embedded in the underlying chaotic invariant set. We uncover a scaling law for the fractal…
We define and study refined Gopakumar-Vafa invariants of contractible curves in complex algebraic 3-folds, alongside the cohomological Donaldson--Thomas theory of finite-dimensional Jacobi algebras. These Gopakumar-Vafa invariants can be…
Defects in topologically ordered models have interesting properties that are reminiscent of the anyonic excitations of the models themselves. For example, dislocations in the toric code model are known as twists and possess properties that…
A modified trace for a finite k-linear pivotal category is a family of linear forms on endomorphism spaces of projective objects which has cyclicity and so-called partial trace properties. We show that a non-degenerate modified trace…
This paper continues work begun in \cite{M1}, in which we introduced a theory of Gowers uniformity norms for singular measures on $\mathbb{R}^d$. There, given a $d$-dimensional measure $\mu$, we introduced a $(k+1)d$-dimensional measure…
The characteristic cohomology $H^k_{char}(d)$ for an arbitrary set of free $p$-form gauge fields is explicitly worked out in all form degrees $k<n-1$, where $n$ is the spacetime dimension. It is shown that this cohomology is…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
One of the main problems of subspace coding asks for the maximum possible cardinality of a subspace code with minimum distance at least $d$ over $\mathbb{F}_q^n$, where the dimensions of the codewords, which are vector spaces, are contained…