Related papers: Higher limits, homology theories and fr-codes
In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper bounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source. The Fibonacci distributions…
In network coding, a flag code is a collection of flags, that is, sequences of nested subspaces of a vector space over a finite field. Due to its definition as the sum of the corresponding subspace distances, the flag distance parameter…
Heffter arrays were introduced by Archdeacon in 2015 as an interesting link between combinatorial designs and topological graph theory. Since the initial paper on this topic, there has been a good deal of interest in Heffter arrays as well…
We discuss the homological algebra of representation theory of finite dimensional algebras and finite groups. We present various methods for the construction and the study of equivalences of derived categories: local group theory, geometry…
We develop a general theory of extensions of flat functors along geometric morphisms of toposes, and apply it to the study of the class of theories whose classifying topos is equivalent to a presheaf topos. As a result, we obtain a…
A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…
We investigate two types of boundedness criteria for bilinear Fourier multiplier operators with symbols with bounded partial derivatives of all (or sufficiently many) orders. Theorems of the first type explicitly prescribe only a certain…
Restriction categories were introduced to provide an axiomatic setting for the study of partially defined mappings; they are categories equipped with an operation called restriction which assigns to every morphism an endomorphism of its…
We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such…
We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as three-valued Fitting-monotonic functions at all levels of…
There is a long tradition of categorifying combinatorial Hopf algebras by the modules of a tower of algebras (or even better via the representation theory of a tower of groups). From the point of view of combinatorics, such a…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
It is widely acknowledged that function symbols are an important feature in answer set programming, as they make modeling easier, increase the expressive power, and allow us to deal with infinite domains. The main issue with their…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
We use Janelidze's Categorical Galois Theory to extend Brown and Ellis's higher Hopf formulae for homology of groups to arbitrary semi-abelian monadic categories. Given such a category A and a chosen Birkhoff subcategory B of A, thus we…
In this paper, we continue our study of the class of diagram groups. Simply speaking, a diagram is a labelled plane graph bounded by a pair of paths (the top path and the bottom path). To multiply two diagrams, one simply identifies the top…
We construct a stable infinity category with objects flow categories and morphisms flow bimodules; our construction has many flavors, related to a choice of bordism theory, and we discuss in particular framed bordism and the bordism theory…
The aim of this paper is to contribute to a better conceptual understanding of gauge quantum field theories, such as quantum chromodynamics, by discussing a famous physical limit, the 't Hooft limit, in which the theory concerned often…
In the context of infinity categories, we rethink the notion of derived functor in terms of correspondences. This is especially convenient for the description of a passage from an adjoint pair (F,G) of functors to a derived adjoint pair…