300 Sozialwissenschaften
Refine
Year of publication
Document Type
- Article (11)
- Doctoral Thesis (9)
- Report (6)
- Monograph/Edited Volume (1)
- Postprint (1)
- Working Paper (1)
Keywords
- Cayley Graph (5)
- Free Group (5)
- Collatz (4)
- Reachability (4)
- Collatz Conjecture (2)
- governance (2)
- Akademischer Nachwuchs (1)
- Autonomie (1)
- Außeruniversitäre Forschungseinrichtungen (1)
- Balance (1)
Institute
- Wirtschaftswissenschaften (29) (remove)
Wissensmanagement
(2019)
Wissen ist für die Bewältigung der Verwaltungsaufgaben eine wichtige Ressource.
Das wirft die Frage auf, wie das notwendige Wissen erzeugt, bewahrt, verteilt und auffindbar gemacht werden kann. Ein solches Wissensmanagement kann die Arbeit der Behörden qualitativ verbessern und effizienter machen. Dennoch wird Wissen in der Verwaltungspraxis bisher nur unzureichend gemanagt.
Ein systematisches Wissensmanagement erfordert personelle, finanzielle und technische Ressourcen. Sind diese nicht vorhanden, können Verwaltungen zunächst auf einzelne Instrumente des Wissensmanagements zurückgreifen, um ihre Arbeit mit begrenztem Aufwand zu verbessern.
The present work will introduce a Finite State Machine (FSM) that processes any Collatz Sequence; further, we will endeavor to investigate its behavior in relationship to transformations of a special infinite input. Moreover, we will prove that the machine’s word transformation is equivalent to the standard Collatz number transformation and subsequently discuss the possibilities for use of this approach at solving similar problems. The benefit of this approach is that the investigation of the word transformation performed by the Finite State Machine is less complicated than the traditional number-theoretical transformation.
The Collatz conjecture is a number theoretical problem, which has puzzled countless researchers using myriad approaches. Presently, there are scarcely any methodologies to describe and treat the problem from the perspective of the Algebraic Theory of Automata. Such an approach is promising with respect to facilitating the comprehension of the Collatz sequence’s "mechanics". The systematic technique of a state machine is both simpler and can fully be described by the use of algebraic means.
The current gap in research forms the motivation behind the present contribution. The present authors are convinced that exploring the Collatz conjecture in an algebraic manner, relying on findings and fundamentals of Graph Theory and Automata Theory, will simplify the problem as a whole.
The Collatz conjecture is a number theoretical problem, which has puzzled countless researchers using myriad approaches. Presently, there are scarcely any methodologies to describe and treat the problem from the perspective of the Algebraic Theory of Automata. Such an approach is promising with respect to facilitating the comprehension of the Collatz sequences "mechanics". The systematic technique of a state machine is both simpler and can fully be described by the use of algebraic means.
The current gap in research forms the motivation behind the present contribution. The present authors are convinced that exploring the Collatz conjecture in an algebraic manner, relying on findings and fundamentals of Graph Theory and Automata Theory, will simplify the problem as a whole.
It is well known that the inverted Collatz sequence can be represented as a graph or a tree. Similarly, it is acknowledged that in order to prove the Collatz conjecture, one must demonstrate that this tree covers all (odd) natural numbers. A structured reachability analysis is hitherto not available. This paper investigates the problem from a graph theory perspective. We define a tree that consists of nodes labeled with Collatz sequence numbers. This tree will be transformed into a sub-tree that only contains odd labeled nodes. The analysis of this tree will provide new insights into the structure of Collatz sequences. The findings are of special interest to possible cycles within a sequence. Next, we describe the conditions which must be fulfilled by a cycle. Finally, we demonstrate how these conditions could be used to prove that the only possible cycle within a Collatz sequence is the trivial cycle, starting with the number 1, as conjectured by Lothar Collatz.
It is well known that the inverted Collatz sequence can be represented as a graph or a tree. Similarly, it is acknowledged that in order to prove the Collatz conjecture, one must demonstrate that this tree covers all odd natural numbers. A structured reachability analysis is hitherto not available. This paper investigates the problem from a graph theory perspective. We define a tree that consists of nodes labeled with Collatz sequence numbers. This tree will be transformed into a sub-tree that only contains odd labeled nodes. The analysis of this tree will provide new insights into the structure of Collatz sequences. The findings are of special interest to possible cycles within a sequence. Next, we describe the conditions which must be fulfilled by a cycle. Finally, we demonstrate how these conditions could be used to prove that the only possible cycle within a Collatz sequence is the trivial cycle, starting with the number one, as conjectured by Lothar Collatz.
It is well known that the inverted Collatz sequence can be represented as a graph or a tree. Similarly, it is acknowledged that in order to prove the Collatz conjecture, one must demonstrate that this tree covers all odd natural numbers. A structured reachability analysis is hitherto unavailable. This paper investigates the problem from a graph theory perspective. We define a tree that consists of nodes labeled with Collatz sequence numbers. This tree will be transformed into a sub-tree that only contains odd labeled nodes. Furthermore, we derive and prove several formulas that can be used to traverse the graph. The analysis covers the Collatz problem both in it’s original form 3x + 1 as well as in the generalized variant kx + 1. Finally, we transform the Collatz graph into a binary tree, following the approach of Kleinnijenhuis, which could form the basis for a comprehensive proof of the conjecture.
It is commonly known that irresponsible alcohol use can have adverse effects. For some people, it results in health problems, for others in productivity loss, and some experience the worst possible outcome of alcohol misuse - death. This paper estimates the effect of reduced alcohol sales hours on alcohol-attributable mortality (AAM) in Estonia. Using novel mortality data from 1997 to 2015, this paper analyzes the effect of alcohol sales policies at both the county level and the country level. By applying the difference-in-differences method and the ARIMA model, this paper finds that the alcohol sales policy reduced AAM to between 1.710 and 2.401 deaths per 100,000 per month, which equals a reduction of 31% to 40% in AAM deaths. These findings suggest that individuals who are the most at risk of dying from alcohol-attributable causes of death benefit remarkably from reduced alcohol availability.
Beyond good faith
(2021)
The ambitious climate targets set by industrialized nations worldwide cannot be met without decarbonizing the building stock. Using Germany as a case study, this paper takes stock of the extensive set of energy efficiency policies that are already in place and clarifies that they have been designed “in good faith” but lack in overall effectiveness as well as cost-efficiency in achieving these climate targets. We map out the market failures and behavioural considerations that are potential reasons for why realized energy savings fall below expectations and why the household adoption of energy-efficient and low-carbon technologies has remained low. We highlight the pressing need for data and modern empirical research to develop targeted and cost-effective policies seeking to correct these market failures. To this end, we identify some key research questions and identify gaps in the data required for evidence-based policy.