English
Related papers

Related papers: Building prescribed quantitative orbit equivalence…

200 papers

In our previous works, we have proposed a quantum description of relativistic orientable objects by a scalar field on the Poincar\'{e} group. This description is, in a sense, a generalization of ideas used by Wigner, Casimir and Eckart back…

General Physics · Physics 2024-06-04 D. M. Gitman , A. L. Shelepin

Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…

Combinatorics · Mathematics 2020-06-01 Justine Falque , Nicolas M. Thiéry

We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…

Group Theory · Mathematics 2024-11-20 Ben Hayes , Srivatsav Kunnawalkam Elayavalli

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

Logic · Mathematics 2025-12-03 Jake Masters

We study the universal groups of inverse semigroups associated with point sets and with tilings. We focus our attention on two classes of examples. The first class consists of point sets which are obtained by a cut and projection scheme…

Group Theory · Mathematics 2007-05-23 Johannes Kellendonk , Mark V Lawson

We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…

Dynamical Systems · Mathematics 2018-06-19 Anush Tserunyan

We show that a non-universal Polish group can induce a complete orbit equivalence relation, which answers a question of Sabok from \cite{OPENPROBLEMS}.

Logic · Mathematics 2026-04-22 Longyun Ding , Ruiwen Li , Bo Peng

Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…

Computational Complexity · Computer Science 2025-11-18 Rida Ait El Manssour , George Kenison , Mahsa Shirmohammadi , Anton Varonka , James Worrell

We introduce the notion of an oriented Steiner quasigroup and develop elements of a relevant algebraic apparatus. The approach is based upon (modified) Schreier-type $f$-extensions for quasigroups (cf. earlier works \cite{S, NSt, NSt2})…

Group Theory · Mathematics 2015-05-07 Izabella Stuhl

Popov classified crystallographic complex reflection groups by determining lattices they stabilize. These analogs of affine Weyl groups have infinite order and are generated by reflections about affine hyperplanes; most arise as the…

Combinatorics · Mathematics 2020-04-21 Philip Puente , Anne V. Shepler

We study definably amenable NIP groups. We develop a theory of generics, showing that various definitions considered previously coincide, and study invariant measures. Applications include: characterization of regular ergodic measures, a…

Logic · Mathematics 2017-12-21 Artem Chernikov , Pierre Simon

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

Group Theory · Mathematics 2018-03-02 Montserrat Casals-Ruiz

Given any quasi-countable, in particular any countable inverse semigroup $S$, we introduce a way to equip $S$ with a proper and right subinvariant extended metric. This generalizes the notion of proper, right invariant metrics for discrete…

Operator Algebras · Mathematics 2024-03-01 Yeong Chyuan Chung , Diego Martínez , Nóra Szakács

It is shown that the set of orbits of the action of the elementary symplectic transvection group on all unimodular elements of a symplectic module over a commutative ring of characteristic not 2 is identical with the set of orbits of the…

Commutative Algebra · Mathematics 2015-03-26 Pratyusha Chattopadhyay , Ravi A. Rao

An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…

Metric Geometry · Mathematics 2015-11-30 Erik Friese , Frieder Ladisch

An action of a compact quantum group on a compact metric space $(X,d)$ is (D)-isometric if the distance function is preserved by a diagonal action on $X\times X$. We show that an isometric action in this sense has the following additional…

Operator Algebras · Mathematics 2015-05-20 Alexandru Chirvasitu

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

Computational Complexity · Computer Science 2015-11-17 Anthony Widjaja Lin , Sanming Zhou

We initiate the study of computational problems on elliptic curve isogeny graphs defined over RSA moduli. We conjecture that several variants of the neighbor-search problem over these graphs are hard, and provide a comprehensive list of…

Number Theory · Mathematics 2019-05-15 Salim Ali Altug , Yilei Chen

Let $\kk$ be a commutative ring, $\AAA$ and $\BB$ -- two $\kk$-linear categories with an action of a group $G$. We introduce the notion of a standard $G$-equivalence from $\Kb\BB$ to $\Kb\AAA$. We construct a map from the set of standard…

Representation Theory · Mathematics 2015-01-06 Yury Volkov , Alexandra Zvonareva

The \emph{Orbit Problem} consists of determining, given a linear transformation $A$ on $\mathbb{Q}^d$, together with vectors $x$ and $y$, whether the orbit of $x$ under repeated applications of $A$ can ever reach $y$. This problem was…

Computational Complexity · Computer Science 2017-01-10 Nathanaël Fijalkow , Pierre Ohlmann , Joël Ouaknine , Amaury Pouly , James Worrell
‹ Prev 1 4 5 6 7 8 10 Next ›