Related papers: Hall sets, Lazard sets and comma-free codes
In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…
We discuss interrelations between: Cohn localizations of full square matrices; a Leavitt localization of a row; and the Jacobson quasi-inverses of quasi-regular elements. The latter Jacobson localizations appear naturally and easily in…
We address the problem of identifying a proof-theoretic framework that enables a compositional analysis of finite-trace properties in concurrent systems, with a particular focus on those specified via prefix-closure. To this end, we…
This paper investigates the hull codes of free linear codes over a non-unital ring $ E= \langle \kappa,\tau \mid 2 \kappa =2 \tau=0,~ \kappa^2=\kappa,~ \tau^2=\tau,~ \kappa \tau=\kappa,~ \tau \kappa=\tau \rangle$. Initially, we examine the…
We provide a construction of free factorization algebras in algebraic geometry and link factorization homology of a scheme with coefficients in a free factorization algebra to the homology of its (unordered) configuration spaces. As an…
We study structures which have arisen in recent work by the present author and Bob Coecke on a categorical axiomatics for Quantum Mechanics; in particular, the notion of strongly compact closed category. We explain how these structures…
Hilbert algebras with supremum, i.e., Hilbert algebras where the associated order is a join-semilattice were first considered by A.V. Figallo, G. Ramon and S. Saad in [11], and independently by S. Celani and D. Montangie in [7]. On the…
Squarefree monomial ideals arising from finite meet-semilattices and their free resolutions are studied. For the squarefree monomial ideals corresponding to poset ideals in a distributive lattice the Alexander dual is computed.
Assuming a large cardinal hypothesis, Laver gave a representation of the monogenerated free left distributive algebra (LDA) using elementary embeddings and used this representation to prove many algebraic results. Some of these results were…
In this paper, we first study in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by Bonini and Borello, and then completely characterize minimal linear codes as cutting blocking…
The free algebra adjunction, between the category of algebras of a monad and the underlying category, induces a comonad on the category of algebras. The coalgebras of this comonad are the topic of study in this paper (following earlier…
We introduce the class of lattice-linear monomial ideals and use the LCM-lattice to give an explicit construction for their minimal free resolution. The class of lattice-linear ideals includes (among others) the class of monomial ideals…
This paper studies the algebraic structure of a new class of hyperplane arrangement $A$ obtained by deleting two hyperplanes from a free arrangement. We provide information on the minimal free resolutions of the logarithmic derivation…
We show that maximal $S$-free convex sets are polyhedra when $S$ is the set of integral points in some rational polyhedron of $\mathbb{R}^n$. This result extends a theorem of Lov\'asz characterizing maximal lattice-free convex sets. Our…
In this article, we study freeness of hyperplane arrangements. One of the most investigated arrangement is a graphic arrangement. Stanley proved that a graphic arrangement is free if and only if the corresponding graph is chordal and Dirac…
We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a…
We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\circ Z$ is a composition of finite sets of words with $Y$…
The set of all $\ell$-zero-sumfree subsets of $\mathbb{Z}/n\mathbb{Z}$ is a simplicial complex denoted by $\Delta_{n,\ell}$ We create an algorithm via defining a set of integer partitions we call $(n,\ell)$-congruent partitions in order to…
We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language $L$, find a maximal independent language containing $L$. We consider the case where the code-related property is…
This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…