Polynomial Roots and Calabi-Yau Geometries

The examination of roots of constrained polynomials dates back at least to Waring and to Littlewood. However, such delicate structures as fractals and holes have only recently been found. We study the space of roots to certain integer polynomials arising naturally in the context of Calabi-Yau spaces, notably Poincare and Newton polynomials, and observe various salient features and geometrical patterns.Comment: 22 pages, 13 Figure

Quiver Gauge Theories: Finitude and Trichotomoty

D-brane probes, Hanany-Witten setups and geometrical engineering stand as a trichotomy of standard techniques of constructing gauge theories from string theory. Meanwhile, asymptotic freedom, conformality and IR freedom pose as a trichotomy of the beta-function behaviour in quantum field theories. Parallel thereto is a trichotomy in set theory of finite, tame and wild representation types. At the intersection of the above lies the theory of quivers. We briefly review some of the terminology standard to the physics and to the mathematics. Then, we utilise certain results from graph theory and axiomatic representation theory of path algebras to address physical issues such as the implication of graph additivity to finiteness of gauge theories, the impossibility of constructing completely IR free string orbifold theories and the unclassifiability of N < 2 Yang-Mills theories in four dimensions

Elements with finite Coxeter part in an affine Weyl group

Let $W_a$ be an affine Weyl group and $\eta:W_a\longrightarrow W_0$ be the natural projection to the corresponding finite Weyl group. We say that $w\in W_a$ has finite Coxeter part if $\eta(w)$ is conjugate to a Coxeter element of $W_0$. The elements with finite Coxeter part is a union of conjugacy classes of $W_a$. We show that for each conjugacy class $\mathcal{O}$ of $W_a$ with finite Coxeter part there exits a unique maximal proper parabolic subgroup $W_J$ of $W_a$, such that the set of minimal length elements in $\mathcal{O}$ is exactly the set of Coxeter elements in $W_J$. Similar results hold for twisted conjugacy classes.Comment: 9 page

Firefly Algorithm: Recent Advances and Applications

Nature-inspired metaheuristic algorithms, especially those based on swarm intelligence, have attracted much attention in the last ten years. Firefly algorithm appeared in about five years ago, its literature has expanded dramatically with diverse applications. In this paper, we will briefly review the fundamentals of firefly algorithm together with a selection of recent publications. Then, we discuss the optimality associated with balancing exploration and exploitation, which is essential for all metaheuristic algorithms. By comparing with intermittent search strategy, we conclude that metaheuristics such as firefly algorithm are better than the optimal intermittent search strategy. We also analyse algorithms and their implications for higher-dimensional optimization problems.Comment: 15 page

Non-Abelian Finite Gauge Theories

We study orbifolds of ${\cal N} = 4$ U(n) super-Yang-Mills theory given by discrete subgroups of SU(2) and SU(3). We have reached many interesting observations that have graph-theoretic interpretations. For the subgroups of SU(2), we have shown how the matter content agrees with current quiver theories and have offered a possible explanation. In the case of SU(3) we have constructed a catalogue of candidates for finite (chiral) ${\cal N}=1$ theories, giving the gauge group and matter content. Finally, we conjecture a McKay-type correspondence for Gorenstein singularities in dimension 3 with modular invariants of WZW conformal models. This implies a connection between a class of finite ${\cal N}=1$ supersymmetric gauge theories in four dimensions and the classification of affine SU(3) modular invariant partition functions in two dimensions.Comment: 28 pages, 5 figs, 1 ref added, 1 table updated and some comments on binary dihedral groups adde

Consensus with Max Registers

We consider the problem of implementing randomized wait-free consensus from max registers under the assumption of an oblivious adversary. We show that max registers solve m-valued consensus for arbitrary m in expected O(log^* n) steps per process, beating the Omega(log m/log log m) lower bound for ordinary registers when m is large and the best previously known O(log log n) upper bound when m is small. A simple max-register implementation based on double-collect snapshots translates this result into an O(n log n) expected step implementation of m-valued consensus from n single-writer registers, improving on the best previously-known bound of O(n log^2 n) for single-writer registers