Universal equivalence of generalized Baumslag–Solitar groups

2020 ◽  
Vol 59 (5) ◽  
pp. 529-541
Author(s):  
F. A. Dudkin
2002 ◽  
Vol 02 (01) ◽  
pp. 1-80 ◽  
Author(s):  
S. JACKSON ◽  
A. S. KECHRIS ◽  
A. LOUVEAU

This paper develops the foundations of the descriptive set theory of countable Borel equivalence relations on Polish spaces with particular emphasis on the study of hyperfinite, amenable, treeable and universal equivalence relations.


2012 ◽  
Vol 22 (04) ◽  
pp. 1250031
Author(s):  
LUC GUYOT

We describe the two-generated limits of abelian-by-(infinite cyclic) groups in the space of marked groups using number theoretic methods. We also discuss universal equivalence of these limits.


2017 ◽  
Vol 114 (17) ◽  
pp. 4336-4341 ◽  
Author(s):  
David A. B. Miller ◽  
Linxiao Zhu ◽  
Shanhui Fan

We derive four laws relating the absorptivity and emissivity of thermal emitters. Unlike the original Kirchhoff radiation law derivations, these derivations include diffraction, and so are valid also for small objects, and can also cover nonreciprocal objects. The proofs exploit two recent approaches. First, we express all fields in terms of the mode-converter basis sets of beams; these sets, which can be uniquely established for any linear optical object, give orthogonal input beams that are coupled one-by-one to orthogonal output beams. Second, we consider thought experiments using universal linear optical machines, which allow us to couple appropriate beams and black bodies. Two of these laws can be regarded as rigorous extensions of previously known laws: One gives a modal version of a radiation law for reciprocal objects—the absorptivity of any input beam equals the emissivity into the “backward” (i.e., phase-conjugated) version of that beam; another gives the overall equality of the sums of the emissivities and the absorptivities for any object, including nonreciprocal ones. The other two laws, valid for reciprocal and nonreciprocal objects, are quite different from previous relations. One shows universal equivalence of the absorptivity of each mode-converter input beam and the emissivity into its corresponding scattered output beam. The other gives unexpected equivalences of absorptivity and emissivity for broad classes of beams. Additionally, we prove these orthogonal mode-converter sets of input and output beams are the ones that maximize absorptivities and emissivities, respectively, giving these beams surprising additional physical meaning.


2022 ◽  
Vol 23 (1) ◽  
pp. 1-42
Author(s):  
Gilles Barthe ◽  
Charlie Jacomme ◽  
Steve Kremer

We study decidability problems for equivalence of probabilistic programs for a core probabilistic programming language over finite fields of fixed characteristic. The programming language supports uniform sampling, addition, multiplication, and conditionals and thus is sufficiently expressive to encode Boolean and arithmetic circuits. We consider two variants of equivalence: The first one considers an interpretation over the finite field F q , while the second one, which we call universal equivalence, verifies equivalence over all extensions F q k of F q . The universal variant typically arises in provable cryptography when one wishes to prove equivalence for any length of bitstrings, i.e., elements of F 2 k for any k . While the first problem is obviously decidable, we establish its exact complexity, which lies in the counting hierarchy. To show decidability and a doubly exponential upper bound of the universal variant, we rely on results from algorithmic number theory and the possibility to compare local zeta functions associated to given polynomials. We then devise a general way to draw links between the universal probabilistic problems and widely studied problems on linear recurrence sequences. Finally, we study several variants of the equivalence problem, including a problem we call majority, motivated by differential privacy. We also define and provide some insights about program indistinguishability, proving that it is decidable for programs always returning 0 or 1.


2020 ◽  
Vol 48 (7) ◽  
pp. 2740-2749
Author(s):  
Benjamin Fine ◽  
Anthony M. Gaglione ◽  
Gerhard Rosenberger ◽  
Dennis Spellman

1972 ◽  
Vol 37 (1) ◽  
pp. 75-80 ◽  
Author(s):  
Philip Olin

First order properties of direct products and direct sums (weak direct products) of relational systems have been studied extensively. For example, in Feferman and Vaught [3] an effective procedure is given for reducing such properties of the product to properties of the factors, and thus in particular elementary equivalence is preserved. We consider here two-sorted relational systems, with the direct product and sum operations keeping one of the sorts stationary. (See Feferman [4] for a similar definition of extensions.)These considerations are motivated by the example of direct products and sums of modules [8], [9]. In [9] examples are given to show that the direct product of two modules (even having only a finite number of module elements) does not preserve two-sorted (even universal) equivalence for any finite or infinitary language Lκ, λ. So we restrict attention here to direct powers and multiples (many copies of one structure). Also in [9] it is shown (for modules, but the proofs generalize immediately to two-sorted structures with a finite number of relations) that the direct multiple operation preserves first order ∀E-equivalence and the direct power operation preserves first order ∀-equivalence. We show here that these results for general two-sorted structures in a finite first order language are, in a sense, best-possible. Examples are given to show that does not imply , and that does not imply .


2011 ◽  
Vol 52 (5) ◽  
pp. 884-891 ◽  
Author(s):  
A. A. Mishchenko ◽  
E. I. Timoshenko

Sign in / Sign up

Export Citation Format

Share Document