Related papers: On determining when small embeddings of partial St…
New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…
Among other results, we prove the following theorem about Steiner minimal trees in $d$-dimensional Euclidean space: if two finite sets in $\mathbb{R}^d$ have unique and combinatorially equivalent Steiner minimal trees, then there is a…
We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…
A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…
A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
In this paper, we study the following semilinear Schr\"odinger system $$ -\triangle u+u=(1+K_\alpha(\epsilon x))|u|^{p-2}u\ in \mathbb{R}^N, u\in H^1(\mathbb{R}^N) $$ where $3\leq p<2^*$ and $\epsilon>0$, $\alpha>0$ are small parameters.…
A family of sets is called union-closed if whenever $A$ and $B$ are sets of the family, so is $A\cup B$. The long-standing union-closed conjecture states that if a family of subsets of $[n]$ is union-closed, some element appears in at least…
We prove a 1973 conjecture due to Erd\H{o}s on the existence of Steiner triple systems with arbitrarily high girth.
A bipartite biregular $(n,m;g)$-graph $G$ is a bipartite graph of even girth $g$ having the degree set $\{n,m\}$ and satisfying the additional property that the vertices in the same partite set have the same degree. An $(n,m;g)$-bipartite…
A new ordering, extending the notion of universal cycles of Chung {\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established…
In the paper the notion of a star partial homeomorphism of a finite dimensional Euclidean space $\mathbb{R}^n$ is introduced. We describe the structure of the semigroup $\mathbf{PStH}_{\mathbb{R}^n}$ of star partial homeomorphisms of the…
In this article we describe the Auslander-Reiten quiver for some posets with an involution, that we call types $\mathfrak{U}_n$ and $\mathfrak{U}_\infty$. These posets appear in the differentiation III of Zavadskij [12]. We follow the…
We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and related to…
The 2-block intersection graph (2-BIG) of a twofold triple system (TTS) is the graph whose vertex set is composed of the blocks of the TTS and two vertices are joined by an edge if the corresponding blocks intersect in exactly two elements.…
We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $\gamma(D)$ the domination number of the incidence (Levy) graph of $D$. We obtain a number of results…
A ring R is said to be VNL if for any a in R, either a or 1-a is (von Neumann) regular. The class of VNL rings lies properly between the exchange rings and (von Neumann) regular rings. We characterize abelian VNL rings. We also characterize…
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…
Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…