Related papers: Batch Codes from Affine Cartesian Codes and Quotie…
This paper presents two enhancements to cylindrical algebraic decomposition (CAD) based quantifier elimination (QE) for cases in which multiple equational constraints are present in the given input formula $\phi^*$. The first enhancement…
We develop a new transmission scheme for additive white Gaussian noisy (AWGN) channels based on Fuchsian groups from rational quaternion algebras. The structure of the proposed Fuchsian codes is nonlinear and nonuniform, hence conventional…
We introduce CODS (Computational Optimization in Design Space), a theoretical model that frames computational design as a constrained optimization problem over a structured, multi-dimensional design space. Unlike existing methods that rely…
The Huffman coding algorithm is interpreted in the lattice of partitions of the source alphabet. Maximal chains in the partition lattice correspond to linear extensions of tree orders, and those among the chains that exhibit a simple greedy…
In this paper we construct new optimal hierarchical locally recoverable codes. Our construction is based on a combination of the ideas of \cite{ballentine2019codes,sasidharan2015codes} with an algebraic number theoretical approach that…
We study affine maps between CAT(0) spaces with geometric actions, and show that they essentially split as products of dilations and linear maps (on the Euclidean factor). This extends known results from the Riemannian case. Furthermore, we…
In exchange for large quantities of data and processing power, deep neural networks have yielded models that provide state of the art predication capabilities in many fields. However, a lack of strong guarantees on their behaviour have…
Recent proposals for a nontrivial quantization of covariant, nonrenormalizable, self-interacting, scalar quantum fields have emphasized the importance of quantum fields that obey affine commutation relations rather than canonical…
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…
We observe algebraic derivations on an affine domain B defined over an algebraically closed field of characteristic 0, which are called locally finite derivations in commutative and non-commutative contexts in other references. We observe…
Network coding can significantly improve the transmission rate of communication networks with packet loss compared with routing. However, using network coding usually incurs high computational and storage costs in the network devices and…
In dynamical systems, shrinking target sets and pointwise recurrent sets are two important classes of dynamically defined subsets. In this article we introduce a mild condition on the linear parts of the affine mappings that allow us to…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
We compute an explicit algebraic deformation quantization for an affine Poisson variety described by an ideal in a polynomial ring, and inheriting its Poisson structure from the ambient space.
We propose a construction of affine space (or "polynomial rings") over a triangulated category, in the context of stable derivators.
In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs. We propose two types of bounds for quadratically constrained quadratic programs, quadratic and cubic bounds. For quadratic bounds, we use affine…
Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian…
In this paper, we employ fixed point theory and semidefinite programming to compute the performance bounds on convex block-sparsity recovery algorithms. As a prerequisite for optimal sensing matrix design, a computable performance bound…
For a (minimal) Arithmetical theory with higher Order Objects, i.e. a (minimal) Cartesian closed arithmetical theory -- coming as such with the corresponding closed evaluation -- we interprete here map codes, out of [A,B] say,into these…
Approximation Fixpoint Theory (AFT) is an algebraic framework designed to study the semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-order definitions. To solve such an issue, we devise a…