Related papers: Minimally Intersecting Set Partitions of Type B
Jaligot's Lemma states that the Fitting subgroups of distinct Borel subgroups do not intersect in a tame minimal simple groups of finite Morley. Such a strong result appears hopeless without tameness. Here we use the 0-unipotence theory to…
This paper is devoted to the generalization of the construction of minimal varieties from the previous work of Meng Chen, Chen Jiang and Binru Li. We first establish several effective nefness criterions for the canonical divisor of weighted…
We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal. Similarly, the existence of a short distinguishing trace is…
Collision detection of a large number N of particles can be challenging. Directly testing N particles for collision among each other leads to N 2 queries. Especially in scenarios, where fast, densely packed particles interact, challenges…
We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…
Given subvarieties $X, Y$ of a complex algebraic variety $S$ of complementary dimension, must they intersect? When $S$ is projective space, this is a consequence of the classical B\'ezout theorem, and an analogue for simple abelian…
Set partitions are arrangements of distinct objects into groups. The problem of listing all set partitions arises in a variety of settings, in particular in combinatorial optimization tasks. After a brief review, we give practical…
This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…
Recently, Adiprasito et al. have initiated the study of the so-called no-dimensional Tverberg problem. This problem can be informally stated as follows: Given $n\geq k$, partition an $n$-point set in Euclidean space into $k$ parts such that…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given…
A family $\mathcal{F}$ on ground set $\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if every collection of $k$ sets in $\mathcal{F}$ has non-empty intersection, and no other set can be added to $\mathcal{F}$ while maintaining this…
We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…
We study the joint asymptotic behavior of spacings between particles at the edge of multilevel Dyson Brownian motions, when the number of levels tends to infinity. Despite the global interactions between particles in multilevel Dyson…
This paper develops a non-asymptotic approach to mean field approximations for systems of $n$ diffusive particles interacting pairwise. The interaction strengths are not identical, making the particle system non-exchangeable. The marginal…
We study a minimal partition problem on the flat rectangular torus. We give a partial review of the existing literature, and present some numerical and theoretical work recently published elsewhere by V. Bonnaillie-No{\"e}l and the author,…
We consider a stochastic process that describes several particles interacting by either merging or annihilation. When two particles merge, they combine their masses; when annihilation occurs, only the particle of smallest mass survives.…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
Splitter sets have been widely studied due to their applications in flash memories, and their close relations with lattice tilings and conflict avoiding codes. In this paper, we give necessary and sufficient conditions for the existence of…
We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection between partial matchings avoiding three…