Median graphs, the remoteness function, periphery transversals, and geodetic number two

A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is constant on G. Moreover, an algorithm is presented that decides in O(mlog n) time whether a given graph G with n vertices and m edges is a median graph with geodetic number 2. Several additional structural properties of the remoteness function on hypercubes and median graphs are obtained and some problems listed

Asymptotics of number fields and the Cohen-Lenstra heuristics

We study the asymptotics conjecture of Malle for dihedral groups Dl of order 2l, where l is an odd prime. We prove the expected lower bound for those groups. For the upper bounds we show that there is a connection to class groups of quadratic number fields. The asymptotic behavior of those class groups is predicted by the Cohen-Lenstra heuristics. Under the assumption of this heuristic we are able to prove the expected upper bounds.

On the equivariant Tamagawa number conjecture for abelian extensions of a quadratic imaginary field

Let k be a quadratic imaginary field, p a prime which splits in k/Q and does not divide the class number hk of k. Let L denote a finite abelian extention of k and let K be a subextention of L/k. In this article we prove the p-part of the Equivariant Tamagawa Number Conjecture for the pair (h0(Spec(L)),Z[Gal(L/K)]).

The Parity of the Number of Irreducible Factors for Some Pentanomials

It is well known that Stickelberger-Swan theorem is very important for determining reducibility of polynomials over a binary field. Using this theorem it was determined the parity of the number of irreducible factors for some kinds of polynomials over a binary field, for instance, trinomials, tetranomials, self-reciprocal polynomials and so on. We discuss this problem for type II pentanomials namely x^m +x^{n+2} +x^{n+1} +x^n +1 \in\ IF_2 [x]. Such pentanomials can be used for efficient implementing multiplication in finite fields of characteristic two. Based on the computation of discriminant of these pentanomials with integer coefficients, it will be characterized the parity of the number of irreducible factors over IF_2 and be established the necessary conditions for the existence of this kind of irreducible pentanomials.

Parity of the Number of Irreducible Factors for Composite Polynomials

Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan’s theorem in which discriminants of polynomials over a finite field or the integral ring Z play an important role. In this paper we consider discriminants of the composition of some polynomials over finite fields. The relation between the discriminants of composed polynomial and the original ones will be established. We apply this to obtain some results concerning the parity of the number of irreducible factors for several special polynomials over finite fields.

Influence of occupation number of single particle levels on K - K charge transfer in collisions of 90 keV - Ne{^9+} on Ne

The influence of the occupation of the single particle levels on the impact parameter dependent K - K charge transfer occuring in collisions of 90 keV Ne{^9+} on Ne was studied using coupled channel calculations. The energy eigenvalues and matrixelements for the single particle levels were taken from ab initio self consistent MO-LCAO-DIRAC-FOCK-SLATER calculations with occupation numbers corresponding to the single particle amplitudes given by the coupled channel calculations.

Algorithms for Tamagawa Number Conjectures

In dieser Arbeit werden Algorithmen zur Untersuchung der äquivarianten Tamagawazahlvermutung von Burns und Flach entwickelt. Zunächst werden Algorithmen angegeben mit denen die lokale Fundamentalklasse, die globale Fundamentalklasse und Tates kanonische Klasse berechnet werden können. Dies ermöglicht unter anderem Berechnungen in Brauergruppen von Zahlkörpererweiterungen. Anschließend werden diese Algorithmen auf die Tamagawazahlvermutung angewendet. Die Epsilonkonstantenvermutung kann dadurch für alle Galoiserweiterungen L|K bewiesen werden, bei denen L in einer Galoiserweiterung E|Q vom Grad kleiner gleich 15 eingebettet werden kann. Für die Tamagawazahlvermutung an der Stelle 1 wird ein Algorithmus angegeben, der die Vermutung für ein gegebenes Fallbeispiel L|Q numerischen verifizieren kann. Im Spezialfall, dass alle Charaktere rational oder abelsch sind, kann dieser Algorithmus die Vermutung für L|Q sogar beweisen.

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Analysis of the relationship between the number of citations and the quality evaluated by experts in psychology journals

Resumen tomado de la publicaci??n

Number Theory

Lecture notes for a number theory course

How do I get the Chapter number in Table or Figure captions to restart in Appendices using the University thesis template in Word 2010?

If you have added the Chapter number to your Table or Figure captions they will show as 1.1, 1.2 and so on. This is linked to the numbering used in the Heading 1 style. However, once you get to the Appendices the last Chapter number will continue throughout the Appendices as the Appendix heading isn't Heading 1. So what you need to do is get Word to understand that the style from which it should be picking up the first part of the Caption has changed and that it will need to restart the numbering again in each subsequent Appendix. This isn't too complex but you must follow the instructions to the letter or else it won't work.

How do I get the Chapter number in Table or Figure captions to restart in Appendices using the University thesis template in Word 2011?

If you have added the Chapter number to your Table or Figure captions they will show as 1.1, 1.2 and so on. This is linked to the numbering used in the Heading 1 style. However, once you get to the Appendices the last Chapter number will continue throughout the Appendices as the Appendix heading isn't Heading 1.

Brain Tumour, Mood Disorder and Encephalopathy. Discusion of the Clinical Case Presented in Volume 6, Number 2

We report a case of a 65 years old female patient, who was admitted to the hospital with non specific neurological symptoms and who had preliminary imagenological findings of an extra-axial tumor mass (a meningioma of the sphenoid’s wing), which was taken to complete surgical removal. Afterwards, she developed progressive neurologic deterioration until her death. The final diagnosis was acute spongiform encephalophaty, and was obtained by cerebral biopsy. Spongiform encephalopathy was described, almost a century ago, as the Creutzfeldt-Jakob Disease, poorly diagnosed in our environment because of its low frequency and uncommon onset, which starts with a mood disorder followed by a phase of dementia and a final fatal outcome. The gold standard for the diagnosis is based on a biopsy or an autopsy of the brain, with immunohistochemical stains for the prionic abnormal protein.

Brain Tumour, Mood Disorder and Encephalopathy. Discusion of the Clinical Case Presented in Volume 6, Number 2

We report a case of a 65 years old female patient, who was admitted to the hospital with non specific neurological symptoms and who had preliminary imagenological findings of an extra-axial tumor mass (a meningioma of the sphenoid’s wing), which was taken to complete surgical removal. Afterwards, she developed progressive neurologic deterioration until her death. The final diagnosis was acute spongiform encephalophaty, and was obtained by cerebral biopsy. Spongiform encephalopathy was described, almost a century ago, as the Creutzfeldt-Jakob Disease, poorly diagnosed in our environment because of its low frequency and uncommon onset, which starts with a mood disorder followed by a phase of dementia and a final fatal outcome. The gold standard for the diagnosis is based on a biopsy or an autopsy of the brain, with immunohistochemical stains for the prionic abnormal protein.

A Strategic-Equilibrium Based

The strategic equilibrium of an N-person cooperative game with transferable utility is a system composed of a cover collection of subsets of N and a set of extended imputations attainable through such equilibrium cover. The system describes a state of coalitional bargaining stability where every player has a bargaining alternative against any other player to support his corresponding equilibrium claim. Any coalition in the sable system may form and divide the characteristic value function of the coalition as prescribed by the equilibrium payoffs. If syndicates are allowed to form, a formed coalition may become a syndicate using the equilibrium payoffs as disagreement values in bargaining for a part of the complementary coalition incremental value to the grand coalition when formed. The emergent well known-constant sum derived game in partition function is described in terms of parameters that result from incumbent binding agreements. The strategic-equilibrium corresponding to the derived game gives an equal value claim to all players.  This surprising result is alternatively explained in terms of strategic-equilibrium based possible outcomes by a sequence of bargaining stages that when the binding agreements are in the right sequential order, von Neumann and Morgenstern (vN-M) non-discriminatory solutions emerge. In these solutions a preferred branch by a sufficient number of players is identified: the weaker players syndicate against the stronger player. This condition is referred to as the stronger player paradox.  A strategic alternative available to the stronger players to overcome the anticipated not desirable results is to voluntarily lower his bargaining equilibrium claim. In doing the original strategic equilibrium is modified and vN-M discriminatory solutions may occur, but also a different stronger player may emerge that has eventually will have to lower his equilibrium claim. A sequence of such measures converges to the equal opportunity for all vN-M solution anticipated by the strategic equilibrium of partition function derived game.    [298-words]