Tootfinder

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
Madhura Dutta, Anil Maheshwari, Subhas C. Nandy, Bodhayan Roy
https://arxiv.org/abs/2505.15949

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a minimum number of nodes. For any real number $α\in(0,1]$, $α$-partial domination problem can be proved to be NP-complete for general graphs. In this paper, we define the {\em maximum dominating $k$-set} of a graph, which is polynomially transformable to the p…

Oriented diameter of graphs with given domination number
Xiaolin Wang, Yaojun Chen
https://arxiv.org/abs/2506.15997 https://arxiv.org…

Oriented diameter of graphs with given domination number
Let $G$ be a connected bridgeless graph with domination number $γ$. The oriented diameter (strong diameter) of $G$ is the smallest integer $d$ for which $G$ admits a strong orientation with diameter (strong diameter) $d$. Kurz and Lätsch (2012) conjectured the oriented diameter of $G$ is at most $\lceil \frac{7γ+1}{2}\rceil$ and the bound is sharp. In this paper, we confirm the conjecture by induction on $γ$ through contracting an unavoidable alternative subgraph, which holds potential for …

The Domination and Secure Domination Numbers of Direct Product of Cliques with Paths and Cycles
Deepak M. Bakal, S. A. Mane
https://arxiv.org/abs/2506.11865

The Domination and Secure Domination Numbers of Direct Product of Cliques with Paths and Cycles
In this paper, we obtain the exact values of several domination parameters for the direct product of a complete graph with a path or a cycle. Specifically, we determine the domination number, independent domination number, $[1,2]$-domination number, secure domination number, and 2-domination number for this family of graphs. We show that, in these graphs, the independent domination number and the $[1,2]$-domination number coincide with the domination number, while the secure domination number c…

La géoéconomie est donc ce qu’il reste Š un capitalisme ravagé par l’échec du néolibéralisme. C’est un moyen de maintenir l’accumulation sous le parapluie de l’État, en maintenant la pression sur le monde du travail.
La déconstruction des États sociaux se poursuit avec davantage d’intensité. l’État continue d’être le bras armé du capital : c’est moins la compétitivité que la sécurité ou la puissance; la puissance étatique se déchaîne désormais contre toute dissension

Sommes-nous entrés dans l’ère de la « géoéconomie » ?
Selon plusieurs chercheurs, le néolibéralisme a fait place à un ordre « géoéconomique » où l’économie est mise au service de la volonté de domination des États. Cette vision permet de comprendre certaines évolutions de notre époque, malgré quelques raccourcis.

Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis, Vassilis Zissimopoulos
https://arxiv.org/abs/2506.12828

Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
In $\textit{total domination}$, given a graph $G=(V,E)$, we seek a minimum-size set of nodes $S\subseteq V$, such that every node in $V$ has at least one neighbor in $S$. We define a $\textit{fault-tolerant}$ version of total domination, where we require any node in $V \setminus S$ to have at least $m$ neighbors in $S$. Let $Δ$ denote the maximum degree in $G$. We prove a first $1 + \ln(Δ+ m - 1)$ approximation for fault-tolerant total domination. We also consider fault-tolerant variants of t…

A heady throng of tech billionaires, ministers, corporate titans and the king of the Netherlands have convened in Sweden for the 71st Bilderberg meeting
– the publicity-shy annual policy conference that has long sustained conspiracy theorists
– hosted this year by the fabulously wealthy Wallenberg family.
The four days of transatlantic talks are taking place at the swanky Grand hotel,
which is owned, like so much else in Sweden, by the Wallenbergs.
The Swedis…

Matrix Weighted $L^p$ Estimates in the Nonhomogeneous Setting
Fernando Benito-de la Cigo\~na, Tainara Borges, Francesco D'Emilio, Marcus Pasquariello, Nathan A. Wagner
https://arxiv.org/abs/2506.15570

Matrix Weighted $L^p$ Estimates in the Nonhomogeneous Setting
We establish a modified pointwise convex body domination for vector-valued Haar shifts in the nonhomogeneous setting, strengthening and extending the scalar case developed in arXiv:2309.13943. Moreover, we identify a subclass of shifts, called $L^1$-normalized, for which the standard convex body domination holds without requiring any regularity assumption on the measure. Finally, we extend the best-known matrix weighted $L^p$ estimates for sparse forms to the nonhomogeneous setting. The key dif…

Early Growth of Structure in Warm Wave Dark Matter
Mustafa A. Amin, Simon May, Mehrdad Mirbabayi
https://arxiv.org/abs/2506.12131 https://

Early Growth of Structure in Warm Wave Dark Matter
We explore the growth of structure in wave-like dark matter models, where the field and density spectra are peaked at sub-horizon wavenumbers. Starting with the Schrödinger-Poisson system, we derive the scale-dependent evolution of the matter power spectrum during radiation and matter domination. We find a suppression of adiabatic perturbations during radiation domination, controlled by a free-streaming length, and scale-dependent growth of the initially white-noise isocurvature power, control…

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- A Linear Kernel for Planar Vector Domination
Mahabba El Sahili, Faisal N. Abu-Khzam

On Domination Exponents for Pairs of Graphs
Grigoriy Blekherman, Annie Raymond, Alexander Razborov, Fan Wei
https://arxiv.org/abs/2506.12151 https://

On Domination Exponents for Pairs of Graphs
Understanding graph density profiles is notoriously challenging. Even for pairs of graphs, complete characterizations are known only in very limited cases, such as edges versus cliques. This paper explores a relaxation of the graph density profile problem by examining the homomorphism density domination exponent $C(H_1, H_2)$. This is the smallest real number $c \geq 0$ such that $t(H_1, T) \geq t(H_2, T)^c$ for all target graphs $T$ (if such a $c$ exists) where $t(H,T)$ is the homomorphism den…

I don’t agree in one respect:
Neither OOP nor FP (nor 4GLs nor IDEs nor SOAs nor any of the other new hotnesses past) had anything remotely resembling the current money behind them. None led to companies speculatively laying off tens of thousands of employees for imagined productivity boosts that had not actually arrived yet. None shaped whole election cycles, or led to national proposals for preemptive deregulation. None led to the construction of nuclear power plants or the draining of rivers. None sent oligarchs or fascists into spasmodic wet dreams of world domination. None started quasi-religious cults like EA.
All •that• is the part that feels like blockchain — but even worse, if such a thing is possible.
@…
2/2

On the domination of surface-group representations in $\mathrm{PU}(2,1)$
Pabitra Barman, Krishnendu Gongopadhyay
https://arxiv.org/abs/2506.03838 https://

On the domination of surface-group representations in $\mathrm{PU}(2,1)$
This article explores surface-group representations into the complex hyperbolic group $\mathrm{PU}(2,1)$ and presents domination results for a special class of representations called $T$-bent representations. Let $S_{g,k}$ be a punctured surface of negative Euler characteristic. We prove that for a $T$-bent representation $ρ: π_1(S_{g,k}) \rightarrow \mathrm{PU}(2,1)$, there exists a discrete and faithful representation $ρ_0: π_1(S_{g,k}) \rightarrow \mathrm{PO}(2,1)$ that dominates $ρ$ in…

Domination and Total Domination Numbers in Zero-divisor Graphs of Commutative Rings
Sarah Anderson, Mike Axtell, Brenda Kroschel, Joe Stickles
https://arxiv.org/abs/2506.02953

Domination and Total Domination Numbers in Zero-divisor Graphs of Commutative Rings
Zero-divisor graphs of commutative rings are well-represented in the literature. In this paper, we consider dominating sets, total dominating sets, domination numbers and total domination numbers of zero-divisor graphs. We determine the domination and total domination numbers of zero-divisor graphs are equal for all zero-divisor graphs of commutative rings except for $\mathbb{Z}_2 \times D$ in which $D$ is a domain. In this case, $γ(Γ(\mathbb{Z}_2 \times D)) = 1$ and $γ_t(Γ(\mathbb{Z}_2 \ti…

Since childhood, I have viewed the family as an inherently authoritarian institution, a primary form of domination that compels obedience and suppresses the individual’s natural freedom to organize themselves, as Rocker made clear in his unyielding critique of all authority.
#Anarchism #Syndicalism

The rise of China, along with regional powers such as Turkey, Indonesia and Saudi Arabia, has disrupted the unipolar dominance of the U.S.
These would-be regional hegemons bring with them their own means of imposing influence through economic incentives and coercion.
In China’s case, infrastructure and trade development through the Belt and Road Initiative is counterbalanced with shows of military strength in the South China Sea.
As the global order becomes increasingly fragm…

Are hegemonies a relic of the past? The role of coercion and consent in global domination
From Athens to the British Empire and on to the US – dominant powers have used might and consent to exert influence.

Finitary codings and stochastic domination for Poisson representable processes
Yinon Spinka
https://arxiv.org/abs/2506.04797 https://…

Finitary codings and stochastic domination for Poisson representable processes
Construct a random set by independently selecting each finite subset of the integers with some probability depending on the set up to translations and taking the union of the selected sets. We show that when the only sets selected with positive probability are pairs, such a random set is a finitary factor of an IID process, answering a question of Forsström, Gantert and Steif. More generally, we show that this is the case whenever the distribution induced by the size of the selected sets has s…

Pairwise similarity method for majority domination problem
N. I. Shushko, D. V. Lemtyuzhnikova
https://arxiv.org/abs/2506.08886 https://

Pairwise similarity method for majority domination problem
The paper considers the problem of finding the number of dominant voters in two-level voting procedures. At the first stage, voting is conducted among local groups of voters, and at the second stage, the results are aggregated to form a final decision. The goal is to determine the minimum proportion of voters supporting a proposal for it to be accepted. The paper uses the method of pairwise comparisons to analyze the structure of the problem and develop heuristic algorithms with guaranteed accu…

I know some of the money is thinking what @… says here. The trouble here is that Tesla is currently wildly, absurdly, comically overvalued wrt its fundamentals, and there are really only two rationalizations for that:
(1) Musk is a brain genius who will innovate the company into magic unicorn fairyland of world domination.
(2) Musk has Trump on a leash and will reap the benefits of kleptocratic plundering of the US Federal budget.
Both of those justifications depend on Musk remaining at Tesla. If he leaves, there’s little reason for the P/E ratio not to correct to normal car company levels — which AIUI would mean a stock price drop of >90%.
https://hachyderm.io/@zzzeek/114637505037473139

This https://arxiv.org/abs/2404.08776 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Complexity of the game connected domination problem
The connected domination game is a variation of the domination game where the played vertices must form a connected subgraph at all stages of the game. In this paper we prove that deciding whether the game connected domination number is smaller than a given integer is PSPACE-complete using log-space reductions for both Dominator- and Staller-start connected domination game.

The reason I’m so fixated on Rudolf Rocker is that he understood authority and centralized control as inherently oppressive structures that suppress individual freedom and the collective ability to self-organize.
He argued that true freedom arises not from legal or political institutions, which often serve to maintain domination, but from the voluntary, free association of people resisting all forms of coercion and hierarchy.
For Rocker, political rights are not granted by govern…

Induced subgraphs and tree decompositions XIX. Bags of bounded domination
Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl
https://arxiv.org/abs/2506.05602 h…

Induced subgraphs and tree decompositions XIX. Bags of bounded domination
We prove that every graph of sufficiently large treewidth has an induced subgraph $H$ of large treewidth such that either $H$ is a subdivided wall or the line graph of a subdivided wall, or every induced subgraph of $H$ admits a tree decomposition where each bag induces a subgraph of small domination number. This is best possible as subdivided walls and their line graphs do not admit such tree decompositions. As a corollary, we deduce that if a graph $G$ has maximum degree at most $Δ\in \mat…

This https://arxiv.org/abs/2505.18811 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

An Anarchist Approach to the Undergraduate Mathematics Curriculum
Contemporary anarchism centers around three tenets: (1) a constant challenge of and resistance to all forms of domination, (2) so-called "prefigurative politics", in which all decisions are made in a manner that is consistent with a set of non-hierarchical values such as equality, decentralization and voluntary cooperation, (3) a focus on diversity and open-endedness (Gordon, 2008). Within this philosophy the notion of end goals becomes moot; progress, then, is measured by process, in which the…

Towards Industrial Convergence : Understanding the evolution of scientific norms and practices in the field of AI
Antoine Houssard
https://arxiv.org/abs/2505.17945

Towards Industrial Convergence : Understanding the evolution of scientific norms and practices in the field of AI
In the field of artificial intelligence (AI) research, there seems to be a rapprochement between academics and industrial forces. The aim of this study is to assess whether and to what extent industrial domination in the field as well as the ever more frequent switch between academia and industry resulted in the adoption of industrial norms and practices by academics. Using bibliometric information and data on scientific code, we aimed to understand academic and industrial researchers' practice…

Proof of a conjecture on isolation of graphs with a universal vertex
Peter Borg, Alastair Farrugia
https://arxiv.org/abs/2506.09290 https://

Proof of a conjecture on isolation of graphs with a universal vertex
A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $ι(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$ intersects the vertex sets of the $F$-copies contained by $G$ (equivalently, $G-N[D]$ contains no $F$-copy). Thus, $ι(G,K_1)$ is the domination number $γ(G)$ of $G$, and $ι(G,K_2)$ is the vertex-edge domination number of $G$. Settling a conjecture of Zhang an…

Why do I even watch this YouTube spectacle about 20 FRP voters and one Red politician?
No state or party can grasp my needs better than I do. All political systems serve only to chain freedom and divide society.
This is why YouTube is a tool of domination, spreading the lies that keep us enslaved.
https://www.

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
Jakob Greilhuber, D\'aniel Marx
https://arxiv.org/abs/2506.01645

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
The $(σ, ρ)$-domination framework introduced by Telle [Nord. J. Comput.'94] captures many classical graph problems. For fixed sets $σ, ρ$ of non-negative integers, a $(σ,ρ)$-set of a graph $G$ is a set $S$ such that for every $v\in V(G)$, we have (1) if $v \in S$, then $|N(v) \cap S| \in σ$, and (2) if $v \not\in S$, then $|N(v) \cap S| \in ρ$. We initiate the study of a natural partial variant of the problem, in which the constraints given by $σ, ρ$ need not be fu…

This https://arxiv.org/abs/2408.00277 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Stochastic Domination of Exit Times for Random Walks and Brownian Motion with Drift
In this note, by an elementary use of Girsanov's transform we show that the exit time for either a biased random walk or a drifted Brownian motion on a symmetric interval is stochastically monotone with respect to the drift parameter. In the random walk case, this gives an alternative proof of a recent result of E. Peköz and R. Righter in 2024. Our arguments in both discrete and continuous cases are parallel to each other. We also outline a simple SDE proof for the Brownian case based on a sta…

Locating-dominating partitions for some classes of graphs
Florent Foucaud, Paras Vinubhai Maniya, Kaustav Paul, Dinabandhu Pradhan
https://arxiv.org/abs/2506.12933

Locating-dominating partitions for some classes of graphs
A dominating set of a graph $G$ is a set $D \subseteq V(G)$ such that every vertex in $V(G) \setminus D$ is adjacent to at least one vertex in $D$. A set $L\subseteq V(G)$ is a locating set of $G$ if every vertex in $V(G) \setminus L$ has pairwise distinct open neighborhoods in $L$. A set $D\subseteq V(G)$ is a locating-dominating set of $G$ if $D$ is a dominating set and a locating set of $G$. The location-domination number of $G$, denoted by $γ_{LD}(G)$, is the minimum cardinality among all …

This https://arxiv.org/abs/2410.12801 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qfi…

Exploring the Interplay of Skewness and Kurtosis: Dynamics in Cryptocurrency Markets Amid the COVID-19 Pandemic
We examine how skewness interacts with kurtosis within the cryptocurrency market. We show that during the COVID-19 pandemic there are more clusters of observations around the two flanks, highlighting the presence of a volatile behavior. Moreover, we document the evolvement of the interrelationship as the pandemic progresses, identifying the domination of the extremes. Our findings advance the thinking that by exploiting the interrelationship between the two higher moments of cryptocurrencies, i…

The $k$-Total Bondage Number of a Graph
Jean-Pierre Appel, Gabby Fischberg, Kyle Kelley, Nathan Shank, Eliel Sosis
https://arxiv.org/abs/2506.07000 https:/…

The $k$-Total Bondage Number of a Graph
Let $G=(V,E)$ be a connected, finite undirected graph. A set $S \subseteq V$ is said to be a total dominating set of $G$ if every vertex in $V$ is adjacent to some vertex in $S$. The total domination number, $γ_{t}(G)$, is the minimum cardinality of a total dominating set in $G$. We define the $k$-total bondage of $G$ to be the minimum number of edges to remove from $G$ so that the resulting graph has a total domination number at least $k$ more than $γ_{t}(G)$. We establish general properties…

An Anarchist Approach to the Undergraduate Mathematics Curriculum
Asia Matthews, Vincent Bouchard
https://arxiv.org/abs/2505.18811 https://

An Anarchist Approach to the Undergraduate Mathematics Curriculum
Contemporary anarchism centers around three tenets: (1) a constant challenge of and resistance to all forms of domination, (2) so-called "prefigurative politics", in which all decisions are made in a manner that is consistent with a set of non-hierarchical values such as equality, decentralization and voluntary cooperation, (3) a focus on diversity and open-endedness (Gordon, 2008). Within this philosophy the notion of end goals becomes moot; progress, then, is measured by process, in which the…

Refinement of a conjecture on positive square energy of graphs
Saieed Akbari, Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada, Shengtong Zhang
https://arxiv.org/abs/2506.07264

Refinement of a conjecture on positive square energy of graphs
Let $G$ be a simple graph of order $n$ with eigenvalues $λ_1(G)\geq \cdots \geq λ_n(G)$. Define \[s^+(G)=\sum_{λ_i >0} λ_i^2(G), \quad s^-(G)=\sum_{λ_i<0} λ_i^2(G).\] It was conjectured by Elphick, Farber, Goldberg and Wocjan that for every connected graph $G$ of order $n$, $s^+(G) \ge n-1.$ We verify this conjecture for graphs with domination number at most 2. We then strengthen the conjecture as follows: if $G$ is a connected graph of order $n$ and size $m \geq n+1$, then $s^+(G) \geq n…