Related papers: Finiteness of Disjoint Covering Systems with Preci…

Let $FI$ be a skeleton of the category of finite sets and injective maps, and $FI^m$ the product of $m$ copies of $FI$. We prove that if an $FI^m$-module is generated in degree $\leqslant d$ and related in degree $\leqslant r$, then its…

In this paper, we show that for a fixed rank $n$, there are only finitely many $m$ for which there is a regular $m$-gonal form of rank $n$ and determine every type of the (generalized) regular $m$-gonal form for every sufficiently large…

Erd\H{o}s first introduced the idea of covering systems in 1950. Since then, much of the work in this area has concentrated on identifying covering systems that meet specific conditions on their moduli. Among the central open problems in…

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

We apply poset cocalculus, a functor calculus framework for functors out of a poset, to study the problem of decomposing multipersistence modules into simpler components. We both prove new results in this topic and offer a new perspective…

We say that a system of differential equations d^2x(t)/dt^2=Adx(t)/dt+Bx(t)+Cu(t), in which A and B are m-by-m complex matrices and C is an m-by-n complex matrix, is rigid if it can be reduced by substitutions x(t)=Sy(t),…

We study relations between the property of being log abundant for lc pairs and the termination of log MMP with scaling. We prove that any log MMP with scaling of an ample divisor starting with a projective dlt pair contains only finitely…

introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…

In this note we improve our upper bound given earlier by showing that every 9-fold covering of a point set in the space by finitely many translates of an octant decomposes into two coverings, and our lower bound by a construction for a…

We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

Let $K_{exp+}$ be the class of all structures $A$ such that the automorphism group of $A$ has at most $c n^{d n}$ orbits in its componentwise action on the set of $n$-tuples with pairwise distinct entries, for some constants $c,d$ with $d <…

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

For a projective hyperplane arrangement, we study sufficient conditions in terms of combinatorial data for ESV-calculability of the monodromy eigenspaces of the first Milnor fiber cohomology for eigenvalues of order $m>1$. This can be…

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.

In this paper we prove that for any definable subset $X\subset \mathbb{R}^{n}$ in a polynomially bounded o-minimal structure, with $dim(X)<n$, there is a finite set of regular projections (in the sense of Mostowski ). We give also a weak…

Using group theoretic methods only, we prove the uniqueness of the smallest embedding cover of a profinite group, Problem 36.2.25 of Field Arithmetic, 4th edition.

Covering systems of the integers were introduced by Erd\H{o}s in 1950. Since then, many beautiful questions and conjectures about these objects have been posed. Most famously, Erd\H{o}s asked whether the minimum modulus of a covering system…

For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…