Results 61 to 70 of about 7,794,861 (172)

Prosoluble subgroups of the profinite completion of the fundamental group of compact 3‐manifolds

Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.
Abstract We give a description of finitely generated prosoluble subgroups of the profinite completion of 3‐manifold groups and toral relatively hyperbolic virtually compact special groups.
Lucas C. Lopes, Pavel A. Zalesskii
wiley   +1 more source

Quantitative estimates on Jacobians for hybrid inverse problems

, 2015
We consider $\sigma$-harmonic mappings, that is mappings $U$ whose components $u_i$ solve a divergence structure elliptic equation ${\rm div} (\sigma \nabla u_i)=0$, for $i=1,\ldots,n $.
Alessandrini, Giovanni, Nesi, Vincenzo
core   +1 more source

The Generic Circular Triangle‐Free Graph

Journal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.
ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley   +1 more source

Producing power-law distributions and damping word frequencies with two-stage language models [PDF]

, 2011
Standard statistical models of language fail to capture one of the most striking properties of natural languages: the power-law distribution in the frequencies of word tokens.
Goldwater, Sharon, Griffiths, Thomas L., Johnson, Mark   +2 more
core  

Optimal Zero‐Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs

Random Structures &Algorithms, Volume 66, Issue 4, July 2025.
ABSTRACT In this paper, we investigate the distribution of zeros of the independence polynomial of hypergraphs of maximum degree Δ$$ \Delta $$. For graphs, the largest zero‐free disk around zero was described by Shearer as having radius λs(Δ)=(Δ−1)Δ−1/ΔΔ$$ {\lambda}_s\left(\Delta \right)={\left(\Delta -1\right)}^{\Delta -1}/{\Delta}^{\Delta ...
Ferenc Bencs, Pjotr Buys
wiley   +1 more source

Strong subgroup recurrence and the Nevo–Stuck–Zimmer theorem

Proceedings of the London Mathematical Society, Volume 130, Issue 6, June 2025.
Abstract Let Γ$\Gamma$ be a countable group and Sub(Γ)$\mathrm{Sub}(\Gamma)$ its Chabauty space, namely, the compact Γ$\Gamma$‐space consisting of all subgroups of Γ$\Gamma$. We call a subgroup Δ∈Sub(Γ)$\Delta \in \mathrm{Sub}(\Gamma)$ a boomerang subgroup if for every γ∈Γ$\gamma \in \Gamma$, γniΔγ−ni→Δ$\gamma ^{n_i} \Delta \gamma ^{-n_i} \rightarrow ...
Yair Glasner, Waltraud Lederle
wiley   +1 more source

Approximate Graph Coloring by Semidefinite Programming [PDF]

, 1998
We consider the problem of coloring k-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3-colorable graph on $n$ vertices with min O(Delta^{1/3} log^{1/2} Delta log n), O(n^{1/4} log^{1/2} n)
Karger, David, Motwani, Rajeev, Sudan, Madhu   +2 more
core   +1 more source

Jacobian elliptic fibrations on K3s with a non‐symplectic automorphism of order 3

Mathematische Nachrichten, Volume 298, Issue 5, Page 1758-1788, May 2025.
Abstract Let X$X$ be a K3 surface admitting a non‐symplectic automorphism σ$\sigma$ of order 3. Building on work by Garbagnati and Salgado, we classify the Jacobian elliptic fibrations on X$X$ with respect to the action of σ$\sigma$ on their fibers. If the fiber class of a Jacobian elliptic fibration on NS(X)$\operatorname{NS}(X)$ is fixed by σ$\sigma$,
Felipe Zingali Meira
wiley   +1 more source

Third-Order Neutral Differential Equations with Non-Canonical Forms: Novel Oscillation Theorems

Axioms
This paper explores the asymptotic and oscillatory properties of a class of third-order neutral differential equations with multiple delays in a non-canonical form.
Barakah Almarri, Belal Batiha, Omar Bazighifan, Fahd Masood   +3 more
doaj   +1 more source

On the Chromatic Thresholds of Hypergraphs

, 2013
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-negative reals c such that the subfamily of F comprising hypergraphs H with minimum degree at least $c \binom{|V(H)|}{r-1}$ has bounded chromatic number ...
DHRUV MUBAYI, Frankl, JANE BUTTERFIELD, JOHN LENZ, JÓZSEF BALOGH, PING HU, Vapnik   +6 more
core   +1 more source