Related papers: Irreducibility of configurations
This paper studies a parametrized family of familiar generalized baker maps, viewed as simple models of time-reversible evolution. Mapping the unit square onto itself, the maps are partly contracting and partly expanding, but they preserve…
We report a numerical calculation of the total number of disordered jammed configurations $\Omega$ of $N$ repulsive, three-dimensional spheres in a fixed volume $V$. To make these calculations tractable, we increase the computational…
An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
In \cite{Ca2016} and \cite{Ca2018}, we introduced a notion of effective reducibility between set-theoretical $\Pi_{2}$-statements; in \cite{Ca2025}, this was extended to statements of arbitrary (potentially even infinite) quantifier…
Morton and Vivaldi defined the polynomials whose roots are parabolic parameters for a one-parameter family of polynomial maps. We call these polynomials delta factors. They conjectured that delta factors are irreducible for the family…
By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually…
The mixed discriminant of a family of point configurations can be considered as a generalization of the $A$-discriminant of one Laurent polynomial to a family of Laurent polynomials. Generalizing the concept of defectivity, a family of…
We consider Albeverio- Rabanovich linear representation $\pi$ of the braid group $B_3$. After specializing the indeterminates used in defining the representation to non-zero complex numbers, we prove that the restriction of $\pi$ to the…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…
We only consider finite structures. With every totally ordered set $V$ and a subset $P$ of $\binom{V}{2}$, we associate the underlying tournament ${\rm Inv}(\underline{V}, P)$ obtained from the transitive tournament $\underline{V}:=(V,…
Given partitions $\alpha$, $\beta$, $\gamma$, the short exact sequences $0\to N_\alpha \to N_\beta \to N_\gamma \to 0$ of nilpotent linear operators of Jordan types $\alpha$, $\beta$, $\gamma$, respectively, define a constructible subset…
Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…
Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecomposable permutations were studied in the literature in various…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…
The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…
To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…
In 1989, Erd\H{o}s conjectured that for a sufficiently large $n$ it is impossible to place $n$ points in general position in a plane such that for every $1\le i \le n-1$ there is a distance that occurs exactly $i$ times. For small $n$ this…