Related papers: Hall sets, Lazard sets and comma-free codes
Let $ R $ be a regular local ring with maximal ideal $ \mathfrak{m} $. We consider elements $ f \in R $ such that their Newton polyhedron has a loose edge. We show that if the symbolic restriction of $f$ to such an edge is a product of two…
In this work, we relate two recent constructions that generalize classical (genus-zero) polylogarithms to higher-genus Riemann surfaces. A flat connection valued in a freely generated Lie algebra on a punctured Riemann surface of arbitrary…
The free resolution and the Alexander dual of squarefree monomial ideals associated with certain subsets of distributive lattices are studied.
This paper gives a description of various recent results which construct monomial ideals with a given minimal free resolution. We show that these are all instances of coordinatizing a finite atomic lattice as defined by Mapes. Subsequently,…
Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…
We give an account of lax orthogonal factorisation systems on order-enriched categories. Among them, we define and characterise the KZ-reflective ones, in a way that mirrors the characterisation of reflective orthogonal factorisation…
We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic…
We introduce the class of MAT-free hyperplane arrangements which is based on the Multiple Addition Theorem by Abe, Barakat, Cuntz, Hoge, and Terao. We also investigate the closely related class of MAT2-free arrangements based on a recent…
We investigate connections between the free lattice generated by a poset while preserving certain bounds and the canonical extension of a poset. Explicitly, we describe how the free lattice generated by a poset while preserving certain…
In this note we study the logarithmic derivation module of a non-free arrangement. We prove a generalized addition theorem for all arrangements. This addition theorem allows us to find various relationships between non-free arrangements,…
Define an augmented LD-system, or ALD-system, to be a set equipped with two binary operations, one satisfying the left self-distributivity law $x * (y * z) = (x * y) * (x * z)$ and the other satisfying the mixed laws $(x o y) * z = x * (y *…
A theory of higher colimits over categories of free presentations is developed. It is shown that different homology functors such as Hoshcshild and cyclic homology of algebras over a field of characteristic zero, simplicial derived…
We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…
In this paper we study algebras of modular forms on unitary groups of signature $(n,1)$. We give a necessary and sufficient condition for an algebra of unitary modular forms to be free in terms of the modular Jacobian. As a corollary we…
Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…
Cameron introduced a bijection between the set of sum-free sets and the set of all zero-one sequences. In this paper, we study the sum-free sets of natural numbers corresponding to certain zero-one sequences which contain the Cantor-like…
In this article we construct a combinatorial quasi-free differential graded model for the Orlik-Solomon algebra of supersolvable matroids, which generalizes in a matroidal setting the cdga of admissible graphs introduced by M. Kontsevich…
Lattice-free sets (convex subsets of $\mathbb{R}^d$ without interior integer points) and their applications for cutting-plane methods in mixed-integer optimization have been studied in recent literature. Notably, the family of all integral…
J. Y. Hyun, et al. (Des. Codes Cryptogr., vol. 88, pp. 2475-2492, 2020) constructed some optimal and minimal binary linear codes generated by one or two order ideals in hierarchical posets of two levels. At the end of their paper, they left…
We present a mechanized embedding of higher-order logic (HOL) and algebraic data types (ADT) into first-order logic with ZFC axioms. We implement this in the Lisa proof assistant for schematic first-order logic and its library based on…