Related papers: Partitioning a reflecting stationary set
In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of…
A natural question, which appeared as Problem 61 in Hart and van Mill's list of open problems on $\beta\omega$ (2024), asks whether every finite partial order is embeddable in the Rudin--Keisler order on (types of) ultrafilters over a…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
We study in this work flat surfaces with conical singularities, that is, surfaces provided with a flat structure with conical singular points. Finding good parameters for these surfaces in the general case is an open question. We give an…
In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…
Under the assumption of small violations of choice with seed $S$ ($\mathsf{SVC}(S)$), the failure of many choice principles reflect to to local properties of $S$, which can be a helpful characterisation for preservation proofs. We…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
The phenomena of radial and axial segregation in a horizontal rotating cylinder containing a mixture of granular particles of two different species have been modeled using discrete particle simulation. Space-time plots and detailed imagery…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.
The feedback class of a locally Brunovsky linear system is fully determined by the decomposition of state space as direct sum of system invariants [4]. In this paper we attack the problem of enumerating all feedback classes of locally…
We show that every structurally submodular separation system admits a canonical tree set which distinguishes its tangles.
We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…
In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…
If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…
In this paper we ivestigate St\"ackel transforms between different classes of parameter-dependent St\"ackel separable systems of the same dimension. We show that the set of all St\"ackel systems of the same dimension splits to equivalence…
The permutation associated with the decimal expression of the binary reflected Gray code with $N$ bits is considered. Its cycle structure is studied. Considered as a set of points, its self-similarity is pointed out. As a fractal, it is…
A partition of the positive integers into sets $A$ and $B$ {\em avoids} a set $S\subset\N$ if no two distinct elements in the same part have a sum in $S$. If the partition is unique, $S$ is {\em uniquely avoidable.} For any irrational…