Related papers: Zero forcing irredundant sets
The paper systematically classifies rings based on the dominant metric dimensions (Ddim) of their associated CZDG, establishing consequential bounds for the Ddim of these compressed zero-divisor graphs. The authors investigate the interplay…
We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…
We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the earlier theoretical work with explicit algorithms and experiments with an implementation. More formally, the robustness…
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
The study of zero-shot generalisation (ZSG) in deep Reinforcement Learning (RL) aims to produce RL algorithms whose policies generalise well to novel unseen situations at deployment time, avoiding overfitting to their training environments.…
In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…
There is interesting internal structure in the nullspaces of graph and hypergraph adjacency matrices, especially for trees, bipartite graphs, and related combinatorial classes. The zero loci of nullvectors, i.e., their zero coordinates'…
Positive $C_0$-semigroups that occur in concrete applications are, more often than not, irreducible. Therefore a deep and extensive theory of irreducibility has been developed that includes characterizations, perturbation analysis, and…
We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…
We investigate near-ring properties that generalize nearfield properties about units. We study zero symmetric near-rings $N$ with identity with two interrelated properties: the units with zero form an additive subgroup of $(N,+)$; the units…
A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.
Throttling in graphs optimizes a sum or product of resources used, such as the number of vertices in an initial set, and time required, such as the propagation time, to complete a given task. We introduce a new technique to establish sharp…
In this paper (as in [Ken15]), we consider an effective version of the characterization of separable metric spaces as zero-dimensional iff every nonempty closed subset is a retract of the space (actually, it is a relative result for closed…
Let f be a function transcendental and meromorphic in the plane, and define g(z) by g(z) = f(z+1) - f(z). A number of results are proved concerning the existence of zeros of g(z) or g(z)/f(z), in terms of the growth and the poles of f.
A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…
A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class forcing extension which…
A modified version of a finite random field Ising ferromagnetic model in an external magnetic field at zero temperature is presented to describe group decision making. Fields may have a non-zero average. A postulate of minimum…
Physical systems may couple to other systems through variables that are not gauge invariant. When we split a gauge system into two subsystems, the gauge-invariant variables of the two subsystems have less information than the gauge…
In 1978, Kulli and Janakiram \citep{KulliJanakiramSplit} defined the split dominating set: a dominating set $S$ of vertices in a graph $G = (V, E)$ is called {\em split dominating} if the induced subgraph $\langle V \setminus S\rangle$ is…
This paper explores the concept of multiset dimensions (Mdim) of compressed zero-divisor graphs (CZDG) associated with rings. The authors investigate the interplay between the ring-theoretic properties of a ring $R$ and the associated…