Related papers: Irreducibility of configurations
In an earlier paper \cite{yu2021Finiteness}, we showed that there are finitely many stationary configurations (consisting of equilibria, rigidly translating configurations, relative equilibria and collapse configurations) in the planar…
Motivated by a conjecture of Erd\H{o}s on the additive irreducibility of small perturbations of the set of squares, recently Hajdu and S\'{a}rk\"{o}zy studied a multiplicative analogue of the conjecture for shifted $k$-th powers. They…
A path system $\mathcal{P}$ in a graph $G=(V,E)$ is said to be irreducible if there does not exist a partition $V= A\sqcup B$ such that $\mathcal{P}$ restricts to a path system on both $G[A]$ and $G[B]$. In this paper, we construct an…
This paper is divided to two parts. In the first part, we provide elementary proofs for some important results in multi-objective optimization. The given proofs are so simple and short in compared to the existing ones. Also, a Pareto…
The literature contains interesting examples of inclusions of simple C$^*$-algebras with the property that all intermediate C$^*$-algebras likewise are simple. In this article we take up a systematic study of such inclusions, which we refer…
Given any connected, open 3-manifold $U$ having finitely many ends, a non-compact 3-manifold $M$ is constructed having the following properties: the interior of $M$ is homeomorphic to $U$; the boundary of $M$ is the disjoint union of…
A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…
Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined…
Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are…
A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…
For an inclusion of the form $\Bbb C\subseteq M_n(\Bbb C)$, where $M_n(\Bbb C)$ is endowed with a state with diagonal weights $\lambda=(\lambda_1, ..., \lambda_n)$, we use Popa's construction, for non-tracial states, to obtain an…
We call an order type inscribable if it is realized by a point configuration where the extreme points are all on a circle. In this paper, we investigate inscribability of order types. We first show that every simple order type with at most…
In 1963, Shrikhande and Raghavarao published a recursive construction for designs that starts with a resolvable design (the "master design") and then uses a second design (the "indexing design") to take certain unions of blocks in each…
Let $b_{\bullet}$ be a sequence of integers $1 < b_1 \leq b_2 \leq \cdots \leq b_{n-1}$. Let $M(b_{\bullet})$ be the space parameterizing nondegenerate, rational curves of degree $e$ in $\mathbb{P}^n$ with ordinary singularities such that…
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
This article precisely defines huge proofs within the system of Natural Deduction for the Minimal implicational propositional logic \mil. This is what we call an unlimited family of super-polynomial proofs. We consider huge families of…
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…
We propose a notion of autoreducibility for infinite time computability and explore it and its connection with a notion of randomness for infinite time machines.
In both classical and quantum physics, irreversible processes are described by maps that contract the space of states. The change in volume has often been taken as a natural quantifier of the amount of irreversibility. In Bayesian…
An abstract $(v_k,b_r)$-configuration is a pair of finite sets of cardinalities $v$ and $b$ with a relation on the product of the sets such that each element of the first set is related to the same number $k$ of elements from the second set…