Results 11 to 20 of about 54,993 (192)

Presentations of Cluster Modular Groups and Generation by Cluster Dehn Twists [PDF]

, 2020
We give a method to compute presentations of saturated cluster modular groups. Using this, we obtain finite presentations of the saturated cluster modular groups of finite mutation type $X_6$ and $X_7$. We verify that the cluster modular groups of finite
Ishibashi, Tsukasa
core   +3 more sources

Complete spectrum of the infinite-$U$ Hubbard ring using group theory [PDF]

, 2014
We present a full analytical solution of the multiconfigurational strongly-correlated mixed-valence problem corresponding to the $N$-Hubbard ring filled with $N-1$ electrons, and infinite on-site repulsion.
Alessandro Soncini, Bruus H., Burnside W., Harari F., Hardy G. H., Willem Van den Heuvel   +5 more
core   +1 more source

Some relational structures with polynomial growth and their associated algebras II: Finite generation [PDF]

, 2018
The profile of a relational structure $R$ is the function $\varphi_R$ which counts for every integer $n$ the number, possibly infinite, $\varphi_R(n)$ of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures being identified ...
Pouzet, Maurice, Thiéry, Nicolas M.
core   +4 more sources

Spin and Statistics and First Principles [PDF]

, 2009
It was shown in the early Seventies that, in Local Quantum Theory (that is the most general formulation of Quantum Field Theory, if we leave out only the unknown scenario of Quantum Gravity) the notion of Statistics can be grounded solely on the local ...
AL Moncayo, Anna-Liisa Hartikainen, E Ronmark, FD Martinez, J Henderson, J Lampi, J Lötvall, J Pekkanen, J Pekkanen, JM Vonk, Jon Genuneit, Juha Pekkanen, Jussi Lampi, KD Nguyen, Marjo-Riitta Järvelin, MC Munthe-Kaas, MR Sears, N Pearce, PE Martin, PL Brand, R Chatterjee, R Ronchetti, RJ Kurukulaaratchy, SE Wenzel, W Eder   +24 more
core   +3 more sources

Quantum walks with infinite hitting times [PDF]

, 2006
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite.
A. Ambainis, A. M. Childs, C. Moore, D. Aharanov, H. Gerhardt, Hari Krovi, J. Kempe, J. L. Gross, J.-P. Serre, P. W. Shor, R. Motwani, S. Sternberg, Todd A. Brun   +12 more
core   +2 more sources

Generalized Fock Spaces, New Forms of Quantum Statistics and their Algebras [PDF]

, 1995
We formulate a theory of generalized Fock spaces which underlies the different forms of quantum statistics such as ``infinite'', Bose-Einstein and Fermi-Dirac statistics.
A J Mcfarlane, A K Mishra, A K Mishra, A K Mishra, A K Mishra, A Schirrmacher, A Shirrmacher, C R Lee, D B Fairlie, D I Fivel, D Zagier, E G Floratos, F Wilczek, G Rajasekaran, G S Agarwal, H S Green, J Cuntz, J Hubbard, J Hubbard, J M Leinass, J W Goodison, L Hlavaty, M Arik, M Arik, M Chaichian, M Chaichian, M Ogata, O W Greenberg, O W Greenberg, O W Greenberg, O W Greenberg, R Chakrabarti, R F Werner, R Haag, R Jagannathan, R N Mohapatra, R Parthasarathy, S Chaturvedi, S Chaturvedi, S Iida, S L Woronowicz, S Stanciu, T Brzezinski, T Suzuki, W Pusz, W Pusz, Y Ohnuki   +46 more
core   +2 more sources

Quantum walks on quotient graphs [PDF]

, 2007
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states ...
A. M. Childs, A. Montanaro, C. Moore, D. Aharanov, F. Maginez, H. Buhrman, Hari Krovi, J. Kempe, J. L. Gross, J. Rotman, L. Grover, P. W. Shor, R. Motwani, Todd A. Brun   +13 more
core   +2 more sources

A counterexample to the reconstruction of $\omega$-categorical structures from their endomorphism monoids [PDF]

, 2016
We present an example of two countable $\omega$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no isomorphism between
Bodirsky, Manuel, Evans, David, Kompatscher, Michael, Pinsker, Michael   +3 more
core   +2 more sources

Coset enumeration for certain infinitely presented groups

, 2011
We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in a finitely $L$-
Hartung, René
core   +1 more source

Universal countable Borel quasi-orders [PDF]

, 2013
In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the quasi-order of ...
Williams, Jay
core   +4 more sources