Related papers: Renormalization of Translated Cone Exchange Transf…
We study the geometry and holonomy of semi-Riemannian, time-like metric cones that are indecomposable, i.e., which do not admit a local decomposition into a semi-Riemannian product. This includes irreducible cones, for which the holonomy…
In this paper we study the non-injectivity arising in infinite interval exchange transformations. In particular, we build and analyze an infinite family of infinite interval exchanges semi-conjugated to generalized Thue-Morse subshifts,…
We introduce a family of polytope exchange transformations (PETs) acting on parallelotopes in $\R^{2n}$ for $n=1,2,3...$. These PETs are constructed using a pair of lattices in $\R^{2n}$. The moduli space of these PETs is $GL_n(\R)$. We…
We study random transformations built from intermittent maps on the unit interval that share a common neutral fixed point. We focus mainly on random selections of Pomeu-Manneville-type maps $T_\alpha$ using the full parameter range $0<…
Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
Nested parentheses are forms in an algebra which define orders of evaluations. A class of well-formed sets of associated opening and closing parentheses is well studied in conjunction with Dyck paths and Catalan numbers. Nested parentheses…
In this paper we construct a version of the standard model gauge sector on noncommutative space-time which is one-loop renormalizable to first order in the expansion in the noncommutativity parameter $\theta$.
For some geometric graph classes, tractability of testing first-order formulas is precisely characterised by the graph parameter twin-width. This was first proved for interval graphs among others in [BCKKLT, IPEC '22], where the equivalence…
Traditionally, reconfiguration problems ask the question whether a given solution of an optimization problem can be transformed to a target solution in a sequence of small steps that preserve feasibility of the intermediate solutions. In…
A one parameter set of noncommutative complex algebras is given. These may be considered deformation quantisation algebras. The commutative limit of these algebras correspond to the algebra of polynomial functions over a manifold or…
We introduce a class of infinitely renormalizable, unicritical diffeomorphisms of the disk (with a non-degenerate "critical point"). In this class of dynamical systems, we show that under renormalization, maps eventually become…
Let $T$ be an $m$-interval exchange transformation. By the rank of $T$ we mean the dimension of the $\mathbb{Q}$-vector space spanned by the lengths of the exchanged intervals. We prove that if $T$ is minimal and the rank of $T$ is greater…
In this paper we construct a version of the standard model gauge sector on noncommutative space-time which is one-loop renormalizable to first order in the expansion in the noncommutativity parameter $\theta$. The one-loop renormalizability…
Polytope exchange transformations (PETs) are higher dimensional generalizations of interval exchange transformations (IETs) which have been well-studied for more than 40 years. A general method of constructing PETs based on multigraphs was…
In this paper, we study the kernel of the reciprocity map of certain simple normal crossing varieties over a finite field and give a example of a simple normal crossing surface whose reciprocity map is not injective for any finite scalar…
A family of discontinuous symplectic maps on the cylinder is considered. This family arises naturally in the study of nonsmooth Hamiltonian dynamics and in switched Hamiltonian systems. The transformation depends on two parameters and is a…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
The allowed patterns of a map are those permutations in the same relative order as the initial segments of orbits realized by the map. In this paper, we characterize and provide enumerative bounds for the allowed patterns of signed shifts,…
Lorenz maps are maps of the unit interval with one critical point of order rho>1, and a discontinuity at that point. They appear as return maps of leafs of sections of the geometric Lorenz flow. We construct real a priori bounds for…