English
Related papers

Related papers: The Intersection of $3$-Maximal Submonids

200 papers

For polyhedral convex cones in ${\mathbb R}^d$, we give a proof for the conic kinematic formula for conic curvature measures, which avoids the use of characterization theorems. For the random cones defined as typical cones of an isotropic…

Metric Geometry · Mathematics 2017-06-13 Rolf Schneider

We give a bound on the minimal number of singularities of a nodal projective complete intersection threefold which contains a smooth complete intersection surface that is not a Cartier divisor.

Algebraic Geometry · Mathematics 2014-12-23 Slawomir Cynk , Slawomir Rams

The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M. For string compression, straight-line programs, i.e., context-free grammars that…

Group Theory · Mathematics 2011-06-07 Markus Lohrey

The intersection of two Steiner triple systems (X,A) and (X,B) is the set A intersect B. The fine intersection problem for Steiner triple systems is to determine for each v, the set I(v), consisting of all possible pairs (m,n) such that…

Combinatorics · Mathematics 2008-07-17 Yeow Meng Chee , Alan C. H. Ling , Hao Shen

The formation of Mach cones is studied in a full $(3+1)$-dimensional setup of ultrarelativistic heavy-ion collisions, considering a transverse and longitudinal expanding medium at Relativistic Heavy-Ion Collider energies. For smooth initial…

High Energy Physics - Phenomenology · Physics 2014-09-30 I. Bouras , B. Betz , Z. Xu , C. Greiner

In this short note, we describe generating sets for the monoids of consisting of all $2 \times 2$ matrices over certain finite tropical semirings.

Rings and Algebras · Mathematics 2020-09-23 James East , Julius Jonušas , J. D. Mitchell

A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…

Combinatorics · Mathematics 2026-01-12 Jacob Fox , Janos Pach , Andrew Suk

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

Define an embedding of graph $G=(V,E)$ with $V$ a finite set of distinct points on the unit circle and $E$ the set of line segments connecting the points. Let $V_1,\ldots,V_k$ be a labeled partition of $V$ into equal parts. A 2-factor is…

Combinatorics · Mathematics 2014-05-06 Drew J. Lipman

We provide a complete classification, in the language of weak-combinatorics, of minimal plus-one generated line arrangements in the complex projective plane with double and triple intersection points.

Algebraic Geometry · Mathematics 2025-09-11 Artur Bromboszcz

The celebrated Erd\H{o}s-Ko-Rado theorem determines the maximum size of a $k$-uniform intersecting family. The Hilton-Milner theorem determines the maximum size of a $k$-uniform intersecting family that is not a subfamily of the so-called…

Combinatorics · Mathematics 2016-08-02 Jie Han , Yoshiharu Kohayakawa

The midpoint set M(S) of a set S of points is the set of all midpoints of pairs of points in S. We study the largest cardinality of a midpoint set M(S) in a finite-dimensional normed space, such that M(S) is contained in the unit sphere,…

Metric Geometry · Mathematics 2011-08-26 Konrad J. Swanepoel

A family X of sets is said to be intersecting if any two members of X have non-empty intersection. It is a well-known and simple fact that an intersecting family of subsets of [n]={1,2,...,n} can contain at most 2^(n-1) sets. Katona, Katona…

Combinatorics · Mathematics 2011-08-17 Paul A. Russell

It is well known that an intersecting family of subsets of an n-element set can contain at most 2^(n-1) sets. It is natural to wonder how `close' to intersecting a family of size greater than 2^(n-1) can be. Katona, Katona and Katona…

Combinatorics · Mathematics 2011-08-30 Paul A. Russell , Mark Walters

A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence. We construct a family of n^{1/3} permutations on n letters, such that…

Combinatorics · Mathematics 2015-03-03 Boris Bukh , Lidong Zhou

We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.

Group Theory · Mathematics 2025-08-07 Andrea Lucchini

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

Commutative Algebra · Mathematics 2019-02-20 Thomas Kahle , Ezra Miller , Christopher O'Neill

We introduce the notion of cracked polytope, and - making use of joint work with Coates and Kasprzyk - construct the associated toric variety $X$ as a subvariety of a non-singular toric variety $Y$ under certain conditions. Restricting to…

Algebraic Geometry · Mathematics 2019-10-14 Thomas Prince

An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

Rich words are characterized by containing the maximum possible number of distinct palindromes. Several characteristic properties of rich words have been studied; yet the analysis of repetitions in rich words still involves some interesting…

Combinatorics · Mathematics 2019-11-15 Aseem Raj Baranwal , Jeffrey Shallit