on classes of non gaussian asymptotic minimizers in entropic uncertainty principles abstract in this paper we revisit the bialynicki birula and mycielski uncertainty principle and its cases of equality this shannon entropic version of the well known heisenberg uncertainty principle can be used when dealing with variables that admit no variance in this paper we extend this uncertainty principle to renyi entropies we recall that in both shannon and renyi cases and for a given dimension n the only case of equality occurs for gaussian random vectors we show that as n grows however the bound is also asymptotically attained in the cases of n dimensional student t and student r distributions a complete analytical study is performed in a special case of a student t distribution we also show numerically that this effect exists for the particular case of a n dimensional cauchy variable whatever the renyi entropy considered extending the results of abe and illustrating the analytical asymptotic study of the student t case in the student r case we show numerically that the same behavior occurs for uniformly distributed vectors these particular cases and other ones investigated in this paper are interesting since they show that this asymptotic behavior cannot be considered as a gaussianization of the vector when the dimension increases

linkable dynkin diagrams abstract in this article we develop some aspects of the construction of new hopf algebras found recently by andruskiewitsch and schneider there the authors classified under some slight restrictions all pointed finite dimensional hopf algebras with coradical z p s we contribute to this work by giving a closer description of the possible exotic linkings

central limit behavior of deterministic dynamical systems we investigate the probability density of rescaled sums of iterates of deterministic dynamical systems a problem relevant for many complex physical systems consisting of dependent random variables a central limit theorem clt is valid only if the dynamical system under consideration is sufficiently mixing for the fully developed logistic map and a cubic map we analytically calculate the leading order corrections to the clt if only a finite number of iterates is added and rescaled and find excellent agreement with numerical experiments at the critical point of period doubling accumulation a clt is not valid anymore due to strong temporal correlations between the iterates nevertheless we provide numerical evidence that in this case the probability density converges to a q gaussian thus leading to a power law generalization of the clt the above behavior is universal and independent of the order of the maximum of the map considered i e relevant for large classes of critical dynamical systems

group entropies correlation laws and zeta functions the notion of group entropy is proposed it enables the unification and generaliztion of many different definitions of entropy known in the literature such as those of boltzmann gibbs tsallis abe and kaniadakis other entropic functionals are introduced related to nontrivial correlation laws characterizing universality classes of systems out of equilibrium when the dynamics is weakly chaotic the associated thermostatistics are discussed the mathematical structure underlying our construction is that of formal group theory which provides the general structure of the correlations among particles and dictates the associated entropic functionals as an example of application the role of group entropies in information theory is illustrated and generalizations of the kullback leibler divergence are proposed a new connection between statistical mechanics and zeta functions is established in particular tsallis entropy is related to the classical riemann zeta function

computational applications of nonextensive statistical mechanics computational applications of the nonextensive entropy s q and nonextensive statistical mechanics a current generalization of the boltzmann gibbs bg theory are briefly reviewed the corresponding bibliography is provided as well

poincare s observation and the origin of tsallis generalized canonical distributions abstract in this paper we present some geometric properties of the maximum entropy tsallis distributions under energy constraint in the case q 1 these distributions are proved to be marginals of uniform distributions on the sphere in the case q 1 they can be constructed as conditional distributions of a cauchy law built from the same uniform distribution on the sphere using a gnomonic projection as such these distributions reveal the relevance of using tsallis distributions in the microcanonical setup an example of such application is given in the case of the ideal gas

lifting of quantum linear spaces and pointed hopf algebras of orderp3 abstract we propose the following principle to study pointed hopf algebras or more generally hopf algebras whose coradical is a hopf subalgebra given such a hopf algebraa consider its coradical filtration and the associated graded coalgebra gr a then gr ais a graded hopf algebra since the coradicala0ofais a hopf subalgebra in addition there is a projection gr a a0 letrbe the algebra of coinvariants of then by a result of radford and majid ris a braided hopf algebra and gr ais the bosonization or biproduct ofranda0 gr a r a0 the principle we propose to studyais first to studyr then to transfer the information to gr avia bosonization and finally to lift toa in this article we apply this principle to the situation whenris the simplest braided hopf algebra a quantum linear space as consequences of our technique we obtain the classification of pointed hopf algebras of orderp3 pan odd prime over an algebraically closed field of characteristic zero with the same hypothesis the characterization of the pointed hopf algebras whose coradical is abelian and has indexporp2 and an infinite family of pointed nonisomorphic hopf algebras of the same dimension this last result gives a negative answer to a conjecture of i kaplansky

on the classification of finite dimensional pointed hopf algebras we classify finite dimensional complex hopf algebras a which are pointed that is all of whose irreducible comodules are one dimensional and whose group of group like elementsg a is abelian such that all prime divisors of the order of g a are 7 since these hopf algebras turn out to be deformations of a natural class of generalized small quantum groups our result can be read as an axiomatic description of generalized small quantum groups

fixed parameter algorithms for rectilinear steiner tree and rectilinear traveling salesman problem in the plane abstract given a set p of n points with their pairwise distances the traveling salesman problem tsp asks for a shortest tour that visits each point exactly once a tsp instance is rectilinear when the points lie in the plane and the distance considered between two points is the l1 distance in this paper a fixed parameter algorithm for the rectilinear tsp is presented and relies on techniques for solving tsp on bounded treewidth graphs it proves that the problem can be solved in o nh7h where h n denotes the number of horizontal lines containing the points of p the same technique can be directly applied to the problem of finding a shortest rectilinear steiner tree that interconnects the points of p providing a o nh5h time complexity both bounds improve over the best time bounds known for these problems

asymptotically scale invariant occupancy of phase space makes the entropy sq extensive phase space can be constructed for n equal and distinguishable subsystems that could be probabilistically either weakly correlated or strongly correlated if they are locally correlated we expect the boltzmann gibbs entropy s bg k i p i ln p i to be extensive i e s bg n n for n in particular if they are independent s bg is strictly additive i e s bg n ns bg 1 n however if the subsystems are globally correlated we expect for a vast class of systems the entropy s q k 1 i p q i q 1 with s 1 s bg for some special value of q 1 to be the one which is extensive i e s q n n for n another concept which is relevant is strict or asymptotic scale freedom or scale invariance defined as the situation for which all marginal probabilities of the n system coincide or asymptotically approach for n the joint probabilities of the n 1 system if each subsystem is a binary one scale freedom is guaranteed by what we hereafter refer to as the leibnitz rule i e the sum of two successive joint probabilities of the n system coincides or asymptotically approaches the corresponding joint probability of the n 1 system the kinds of interplay of these various concepts are illustrated in several examples one of them justifies the title of this paper we conjecture that these mechanisms are deeply related to the very frequent emergence in natural and artificial complex systems of scale free structures and to their connections with nonextensive statistical mechanics summarizing we have shown that for asymptotically scale invariant systems it is s q with q 1 and not s bg the entropy which matches standard clausius like prescriptions of classical thermodynamics

hamilton paths in grid graphs a grid graph is a node induced finite subgraph of the infinite grid it is rectangular if its set of nodes is the product of two intervals given a rectangular grid graph and two of its nodes we give necessary and sufficient conditions for the graph to have a hamilton path between these two nodes in contrast the hamilton path and circuit problem for general grid graphs is shown to be np complete this provides a new relatively simple proof of the result that the euclidean traveling salesman problem is np complete

finite quantum groups and cartan matrices abstract we consider a class of hopf algebras having as an invariant a generalized cartan matrix for a hopf algebra of this kind we prove that it is finite dimensional if and only if its generalized cartan matrix is actually a finite cartan matrix under some mild hypothesis these results allow us to classify all the finite dimensional coradically graded pointed hopf algebras whose coradical has odd prime dimension p we also characterize coradically graded pointed hopf algebras of order p 4

information theoretic approach to statistical properties of multivariate cauchy lorentz distributions the cauchy lorentz cl distribution has divergent lowest moments this necessarily leads to the fact that the information theoretic approach is essential for the study of its statistical properties here correlation measured by the mutual entropy is discussed for the multivariate cl distribution it is found that correlation obeys a simple scaling law with respect to the dimensionality of the distribution then regarding the cl distribution as a power law quantum wavepacket the information entropic uncertainty relation is also discussed both analytically and numerically it is found that the sum of the position and momentum information entropies tends to the value of the lower bound for large dimensions

central limit theorem and deformed exponentials the central limit theorem clt can be ranked among the most important ones in probability theory and statistics and plays an essential role in several basic and applied disciplines notably in statistical thermodynamics we show that there exists a natural extension of the clt from exponentials to so called deformed exponentials also denoted as q gaussians our proposal applies exactly in the usual conditions in which the classical clt is used

limit behaviour and scaling relations of two kinds of noisy logistic map in the vicinity of chaos threshold and their robustness abstract in this paper we numerically investigate the distribution of the sums of the iterates of the logistic map and the relationships among the important properties of the nonlinear dynamics in the vicinity of the chaos threshold by adding two kinds of contributions with different densities the first one is the well known white noise whereas the second is a newly defined one named as quartic term which makes contributions from the own structure of the map as the chaos threshold is approached the iterates of the standard logistic map i e noise free have strong correlations and the standard central limit theorem is not valid anymore in a recent work tirnakli 2009 it has been shown that the limit distribution seems to converge to q gaussian distribution which maximizes the nonadditive entropy s q 1 i p i q q 1 under appropriate conditions in this work we investigate the effect of these contributions i e white noise and quartic term on the limit distribution and on the range of the obtained q gaussian distribution as a result of these findings under the existence of white noise and also the quartic term we analyse the validity of the scaling relations among correlation fractality the lyapunov divergence and q gaussian distributions which have recently been observed in afsar 2014 the results obtained here strengthen the argument that the central limit behaviour is given by a q gaussian as the chaos threshold is approached and indicate that the scaling relations obtained for the standard logistic map among the range of the q gaussian the correlation dimension the correlation length the lyapunov exponent fractality and the distance from the chaos threshold are robust under the existence of white noise and the quartic term

on q gaussians and exchangeability the q gaussian distributions introduced by tsallis are discussed from the point of view of variance mixtures of normals and exchangeability for each there is a q gaussian distribution that maximizes the tsallis entropy under suitable constraints this paper shows that q gaussian random variables can be represented as variance mixtures of normals when q 1 these variance mixtures of normals are the attractors in central limit theorems for sequences of exchangeable random variables thereby providing a possible model that has been extensively studied in probability theory the formulation provided has the additional advantage of yielding for each q a process which is naturally the q analog of the brownian motion explicit mixing distributions for q gaussians should facilitate applications to areas such as option pricing the model might provide insight into the study of superstatistics

compact formulations of the steiner traveling salesman problem and related problems the steiner traveling salesman problem stsp is a variant of the tsp that is particularly suitable when routing on real life road networks the standard integer programming formulations of both the tsp and stsp have an exponential number of constraints on the other hand several compact formulations of the tsp i e formulations of polynomial size are known in this paper we adapt some of them to the stsp and compare them both theoretically and computationally it turns out that just by putting the best of the formulations into the cplex branch and bound solver one can solve instances with over 200 nodes we also briefly discuss the adaptation of our formulations to some related problems

order picking in a rectangular warehouse a solvable case of the traveling salesman problem this paper addresses the problem of order picking in a rectangular warehouse that contains crossovers only at the ends of aisles an algorithm is presented for picking an order in minimum time the computational effort required is linear in the number of aisles the procedure has been implemented on a microcomputer a 50 aisle problem requires only about 1 minute to solve

polynomial time approximation schemes for euclidean traveling salesman and other geometric problems we present a polynomial time approximation scheme for euclidean tsp in fixed dimensions for every fixed c 1 and given any n nodes in r 2 a randomized version of the scheme finds a 1 1 c approximation to the optimum traveling salesman tour in o n log n o c time when the nodes are in r d the running time increases to o n log n o d c d 1 for every fixed c d the running time is n poly log n that is nearly linear in n the algorithmm can be derandomized but this increases the running time by a factor o n d the previous best approximation algorithm for the problem due to christofides achieves a 3 2 aproximation in polynomial time we also give similar approximation schemes for some other np hard euclidean problems minimum steiner tree k tsp and k mst the running times of the algorithm for k tsp and k mst involve an additional multiplicative factor k the previous best approximation algorithms for all these problems achieved a constant factor approximation we also give efficient approximation schemes for euclidean min cost matching a problem that can be solved exactly in polynomial time all our algorithms also work with almost no modification when distance is measured using any geometric norm such as e p for p 1 or other minkowski norms they also have simple parallel i e nc implementations

spatial quantum zeno effect abstract the quantum zeno effect is usually discussed in the context of temporal evolution of a quantum state we investigate its counterpart in the spatial context and present a general criterion for the occurrence of spatial quantum zeno effect furthermore a parameter based position momentum uncertainty relation involving absolute moment of any order less than 2 is obtained