Bristol, GB, facility
Attila Maróti, Kamilla Rekvényi
Abstract Let G be a primitive permutation group acting on a finite set X . The orbital diameter $$\textrm{diam}(X,G)$$ diam ( X , G ) is defined to be the supremum of the diameters of the (connected) orbital graphs of G after …
hu, gb (code pays fourni par la source)
Ulrich Pennig, George Tridimas
Lifting obstructions for group actions, cocycle actions, and $Γ$-kernels admit a cohomological description via topological crossed modules, as recently developed by Izumi, Giron-Pacheco, and the first named author. For a strongly self-absorbing $C^*$-algebra $A$, we show that the classifying spaces $\mathcal{B}^D\mathcal{G}_A$ and …
gb (code pays fourni par la source)
Joseph P. MacManus, Bobby Miraftab
We show that the separation profile of a hyperbolic planar graph and, more generally, a hyperbolic apex-minor-free graph, grows at most logarithmically, answering a question of Benjamini, Schramm, and Timár in the affirmative.
gb, ca (code pays fourni par la source)
Saul D. Freedman, Hong Yi Huang, Melissa G.Y. Lee, Kamilla Rekvényi
A base for a finite permutation group G ⩽ Sym ( Ω ) is a subset of Ω with trivial pointwise stabiliser in G , and the base size of G is the smallest size of a base for G . Motivated …
au, hu, gb (code pays fourni par la source)
Let $V \subset \mathbb{A}^2(\mathbb{C})$ be an algebraic curve such that $\mathrm{deg} X \neq \mathrm{deg} Y$, where $X, Y$ denote the coordinate functions on $\mathbb{A}^2(\mathbb{C})$ restricted to $V$. We prove there exists an effectively computable constant $c$, that depends linearly on the height …
gb (code pays fourni par la source)
Abstract In this paper, we construct an implementable algorithm that solves the conjugacy problem in twisted right-angled Artin groups (T-RAAGs). In certain cases, the complexity is known to be linear, by reducing the problem to the twisted conjugacy problem in RAAGs. We …
gb (code pays fourni par la source)
We construct uncountably many finitely generated, pairwise non-isomorphic torsion-free groups, all of which fall into the same quasi-isometry class. This is done by considering Schur covering groups and group cohomology, with the necessary geometric ingredient coming from the theory of bounded-valued cohomology.
gb (code pays fourni par la source)
Dane Michael Wolf, Endri Mjeku, Mayuko Segawa, Alva M. Casey et autres
Abstract The mitochondrial genome (mtDNA) is essential for oxidative phosphorylation, and mammalian cells typically contain hundreds or thousands of copies. Although specific aspects of mtDNA replication and degradation have been explored, a complete account of the mtDNA life cycle has remained elusive, …
gb (code pays fourni par la source)
Mark J. Crumpton, Francesco Mezzadri
We employ the recently developed Kac-Rice formalism for non-Hermitian random matrices to derive the joint distribution of an eigenvalue and its associated normalised right eigenvector in a Gaussian ensemble that interpolates between complex Ginibre (Class A) and complex symmetric matrices (Class AI$^\dagger$). …
gb (code pays fourni par la source)
Andrew Harrison-Migochi, Raymond McCulloch
Let [Formula: see text] be a lattice and let [Formula: see text] be a definable family in an o-minimal expansion of the real field, [Formula: see text]. A result of Barroero and Widmer gives sharp estimates for the number of lattice points …
gb (code pays fourni par la source)
Abstract We prove an arithmetic refinement of the Yau–Zaslow formula by replacing the classical Euler characteristic in Beauville’s argument by a motivic Euler characteristic, related to the work of Levine. Our result implies similar formulas for other related invariants, including a generalisation …
gb, hu (code pays fourni par la source)
Christopher W. Parker, Jack Saunders
Abstract Let be a finite group and a normal subset consisting of odd‐order elements. The rational closure of , denoted , is the set of elements with the property that for some in . If , we prove that is soluble.
gb (code pays fourni par la source)
BNTIC News n’est pas le producteur de ces données. Les publications sont interrogées à la demande dans Crossref, OpenAIRE, DOAJ, Europe PMC, HAL, DataCite, AfricArXiv, ROR et la Banque mondiale, sans clé d’accès. OpenAlex reste optionnel. Aucun service payant n’est nécessaire et aucune donnée externe n’est enregistrée en base. Consulter les sources et leurs limites.
L'essentiel de l'actu tech du Burkina & d'Afrique, chaque semaine dans votre boîte mail.
Gratuit · sans spam · désinscription en un clic