Peg solitaire on graphs with large maximum degree

2021 ◽  
pp. 2250057
Author(s):  
Naoki Matsumoto
Keyword(s):  
Connected Graph ◽  
Maximum Degree ◽  
Terminal State ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Combinatorial Game ◽  
Starting State ◽  
Large Maximum ◽  
Necessary And Sufficient

In 2011, Beeler and Hoilman introduced the peg solitaire on graphs. The peg solitaire on a connected graph is a one-player combinatorial game starting with exactly one hole in a vertex and pegs in all other vertices and removing all pegs but exactly one by a sequence of jumps; for a path [Formula: see text], if there are pegs in [Formula: see text] and [Formula: see text] and exists a hole in [Formula: see text], then [Formula: see text] can jump over [Formula: see text] into [Formula: see text], and after that, the peg in [Formula: see text] is removed. A problem of interest in the game is to characterize solvable (respectively, freely solvable) graphs, where a graph is solvable (respectively, freely solvable) if for some (respectively, any) vertex [Formula: see text], starting with a hole [Formula: see text], a terminal state consisting of a single peg can be obtained from the starting state by a sequence of jumps. In this paper, we consider the peg solitaire on graphs with large maximum degree. In particular, we show the necessary and sufficient condition for a graph with large maximum degree to be solvable in terms of the number of pendant vertices adjacent to a vertex of maximum degree. It is a notable point that this paper deals with a question of Beeler and Walvoort whether a non-solvable condition of trees can be extended to other graphs.

scholarly journals Minimally locally 1-connected graphs

1978 ◽  
Vol 19 (1) ◽  
pp. 77-80 ◽  
Author(s):  
K.H. Kulkarni
Keyword(s):  
Connected Graph ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Local Connectivity ◽  
Connected Graphs ◽  
Necessary And Sufficient

The local connectivity, νk(G), of a graph G is the minimum of the connectivities of neighbourhoods of the vertices of G. G is minimally locally n-connected if νk(G) = n and for every edge x of G, νk(G−x) = n − 1. A necessary and sufficient condition for a locally connected graph to be minimally locally 1-connected is given, and it is shown that for n ≥ 7, is minimally locally 1-connected.

Super Edge-Connected Linear Hypergraphs

2020 ◽  
Vol 30 (03) ◽  
pp. 2040003
Author(s):  
Shangwei Lin ◽  
Jianfeng Pei ◽  
Chunfang Li
Keyword(s):  
Connected Graph ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Edge Connectivity ◽  
Necessary And Sufficient ◽  
Linear Hypergraphs ◽  
Linear Hypergraph

A connected graph [Formula: see text] is super edge-connected, if every minimum edge-cut of [Formula: see text] is the set of edges incident with a vertex. In this paper, the concept of super edge-connectivity of graphs is generalized to hypergraphs and a necessary and sufficient condition for an [Formula: see text]-uniform and linear hypergraph with diameter at most 2 to be super edge-connected is given.

A Proposed Framework Emphasizing Auditor Reliability over Auditor Independence

2003 ◽  
Vol 17 (3) ◽  
pp. 257-266 ◽  
Author(s):  
Mark H. Taylor ◽  
F. Todd DeZoort ◽  
Edward Munn ◽  
Martha Wetterhall Thomas
Keyword(s):  
Public Interest ◽  
Auditor Independence ◽  
Public Confidence ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Accounting Profession ◽  
The Public ◽  
Necessary And Sufficient

This paper introduces an auditor reliability framework that repositions the role of auditor independence in the accounting profession. The framework is motivated in part by widespread confusion about independence and the auditing profession's continuing problems with managing independence and inspiring public confidence. We use philosophical, theoretical, and professional arguments to argue that the public interest will be best served by reprioritizing professional and ethical objectives to establish reliability in fact and appearance as the cornerstone of the profession, rather than relationship-based independence in fact and appearance. This revised framework requires three foundation elements to control subjectivity in auditors' judgments and decisions: independence, integrity, and expertise. Each element is a necessary but not sufficient condition for maximizing objectivity. Objectivity, in turn, is a necessary and sufficient condition for achieving and maintaining reliability in fact and appearance.

The Power of Public Positions

2018 ◽  
Author(s):  
Thomas Sinclair
Keyword(s):  
Detailed Analysis ◽  
Political Authority ◽  
The State ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
State Institutions ◽  
State Of Nature ◽  
Necessary And Sufficient

The Kantian account of political authority holds that the state is a necessary and sufficient condition of our freedom. We cannot be free outside the state, Kantians argue, because any attempt to have the “acquired rights” necessary for our freedom implicates us in objectionable relations of dependence on private judgment. Only in the state can this problem be overcome. But it is not clear how mere institutions could make the necessary difference, and contemporary Kantians have not offered compelling explanations. A detailed analysis is presented of the problems Kantians identify with the state of nature and the objections they face in claiming that the state overcomes them. A response is sketched on behalf of Kantians. The key idea is that under state institutions, a person can make claims of acquired right without presupposing that she is by nature exceptional in her capacity to bind others.

scholarly journals Lorentz Boosts and Wigner Rotations: Self-Adjoint Complexified Quaternions

Physics ◽  
2021 ◽  
Vol 3 (2) ◽  
pp. 352-366
Author(s):  
Thomas Berry ◽  
Matt Visser
Keyword(s):  
Point Of View ◽  
Sufficient Condition ◽  
Use Of Self ◽  
Necessary And Sufficient Condition ◽  
Wigner Rotation ◽  
Inertial Frames ◽  
Explicit Formulae ◽  
Specific Implementation ◽  
Necessary And Sufficient ◽  
Lorentz Boosts

In this paper, Lorentz boosts and Wigner rotations are considered from a (complexified) quaternionic point of view. It is demonstrated that, for a suitably defined self-adjoint complex quaternionic 4-velocity, pure Lorentz boosts can be phrased in terms of the quaternion square root of the relative 4-velocity connecting the two inertial frames. Straightforward computations then lead to quite explicit and relatively simple algebraic formulae for the composition of 4-velocities and the Wigner angle. The Wigner rotation is subsequently related to the generic non-associativity of the composition of three 4-velocities, and a necessary and sufficient condition is developed for the associativity to hold. Finally, the authors relate the composition of 4-velocities to a specific implementation of the Baker–Campbell–Hausdorff theorem. As compared to ordinary 4×4 Lorentz transformations, the use of self-adjoint complexified quaternions leads, from a computational view, to storage savings and more rapid computations, and from a pedagogical view to to relatively simple and explicit formulae.

Sign in / Sign up

Export Citation Format

Share Document