English
Related papers

Related papers: Hall sets, Lazard sets and comma-free codes

200 papers

Given a partially ordered set $P$ there exists the most general Boolean algebra $F(P)$ which contains $P$ as a generating set, called the {\it free Boolean algebra} over $P$. We study free Boolean algebras over posets of the form $P=P_0\cup…

General Topology · Mathematics 2012-10-23 Robert Bonnet , Latifa Faouzi , Wiesław Kubiś

We compute the type (maximum linearization) of the well partial order of bounded lower sets in $\mathbb{N}^m$, ordered under inclusion, and find it is $\omega^{\omega^{m-1}}$. Moreover we compute the type of the set of all lower sets in…

Logic · Mathematics 2025-05-09 Harry Altman , Andreas Weiermann

Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…

Commutative Algebra · Mathematics 2012-10-05 Zike Deng

The zero sets of harmonic polynomials play a crucial role in the study of the free boundary regularity problem for harmonic measure. In order to understand the fine structure of these free boundaries a detailed study of the singular points…

Classical Analysis and ODEs · Mathematics 2018-03-16 Matthew Badger , Max Engelstein , Tatiana Toro

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the (3+1)-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have…

Combinatorics · Mathematics 2014-04-18 Mathieu Guay-Paquet , Alejandro H. Morales , Eric Rowland

We study the ring theoretical structures of mixable shuffle algebras and their associated free commutative Rota-Baxter algebras. For this study we utilize the connection of the mixable shuffle algebras with the overlapping shuffle algebra…

Rings and Algebras · Mathematics 2008-07-22 Li Guo , Bingyong Xie

Finding the maximum size of a Sidon set in $\mathbb{F}_2^t$ is of research interest for more than 40 years. In order to tackle this problem we recall a one-to-one correspondence between sum-free Sidon sets and linear codes with minimum…

Combinatorics · Mathematics 2026-01-05 Ingo Czerwinski , Alexander Pott

A $k$-configuration is a collection of $k$ distinct integers $x_1,\ldots,x_k$ together with their pairwise arithmetic means $\frac{x_i+x_j}{2}$ for $1 \leq i < j \leq k$. Building on recent work of Filmus, Hatami, Hosseini and Kelman on…

Number Theory · Mathematics 2025-01-20 Adrian Beker

We derive the algebraic relations of alternating and non-alternating finite harmonic sums up to the sums of depth~6. All relations for the sums up to weight~6 are given in explicit form. These relations depend on the structure of the index…

High Energy Physics - Phenomenology · Physics 2008-11-26 J. Blümlein

Free noncommutative fields constitute a natural and interesting example of constrained theories with higher derivatives. The quantization methods involving constraints in the higher derivative formalism can be nicely applied to these…

High Energy Physics - Theory · Physics 2008-11-26 R. Amorim , J. Barcelos-Neto

We use the lcm-lattice of a monomial ideal to study its minimal free resolutions. A new concept called a Taylor basis of a minimal free resolution is introduced and then used throughout the paper. We give a method of constructing minimal…

Commutative Algebra · Mathematics 2019-01-18 Ri-Xiang Chen

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…

Commutative Algebra · Mathematics 2019-12-02 Alfred Geroldinger , Qinghai Zhong

Let $H$ be an atomic monoid. For $x \in H$, let $\mathsf{L}(x)$ denote the set of all possible lengths of factorizations of $x$ into irreducibles. The system of sets of lengths of $H$ is the set $\mathcal{L}(H) = \{\mathsf{L}(x) \mid x \in…

Commutative Algebra · Mathematics 2019-07-11 Felix Gotti

We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with…

Information Theory · Computer Science 2017-05-09 Antonio Campello , Ling Liu , Cong Ling

We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result…

Optimization and Control · Mathematics 2017-01-24 Amitabh Basu , Michele Conforti , Gerard Cornuejols , Giacomo Zambelli

We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that…

Information Theory · Computer Science 2024-05-13 Roberto Bruno , Ugo Vaccaro

Ideal subarrangements of a Weyl arrangement are proved to be free by the multiple addition theorem (MAT) due to Abe-Barakat-Cuntz-Hoge-Terao (2016). They form a significant class among Weyl subarrangements that are known to be free so far.…

Combinatorics · Mathematics 2022-04-20 Tan Nhat Tran , Shuhei Tsujie

Let $\mathcal O$ be a holomorphy ring in a global field $K$, and $R$ a classical maximal $\mathcal O$-order in a central simple algebra over $K$. We study sets of lengths of factorizations of cancellative elements of $R$ into atoms…

Rings and Algebras · Mathematics 2013-08-15 Daniel Smertnig

We study direct-sum decompositions of torsion-free, finitely generated modules over a (commutative) Bass ring $R$ through the factorization theory of the corresponding monoid $T(R)$. Results of Levy-Wiegand and Levy-Odenthal together with a…

Commutative Algebra · Mathematics 2021-03-18 Nicholas R. Baeth , Daniel Smertnig

Abstract. This article determines relations between two notions concerning monoids: factorability structure, introduced to simplify the bar complex; and quadratic normalisation, introduced to generalise quadratic rewriting systems and…

Group Theory · Mathematics 2025-01-03 Alen Đurić