English
Related papers

Related papers: Logarithmic Embeddings and Logarithmic Semistable …

200 papers

The Erd\H{o}s--Ko--Rado theorem is extended to designs in semilattices with certain conditions. As an application, we show the intersection theorems for the Hamming schemes, the Johnson schemes, bilinear forms schemes, Grassmann schemes,…

Combinatorics · Mathematics 2012-01-25 Sho Suda

In a recent paper by the authors, a new approach--called the "embedding method"--was introduced, which allows to make use of exchangeable pairs for normal and multivariate normal approximation with Stein's method in cases where the…

Probability · Mathematics 2009-12-18 Gesine Reinert , Adrian Röllin

In this paper we develop an ideal structure theory for the class of left reductive regular semigroups and apply it to several subclasses of popular interest. In these classes we observe that the right ideal structure of the semigroup is…

Group Theory · Mathematics 2025-12-17 P. A. Azeef Muhammed , Gracinda M. S. Gomes

In arXiv:math/0311139, as evidence for his conjecture in birational log geometry, Kawamata constructed a family of derived equivalences between toric orbifolds. In arXiv:0911.4711, we showed that the derived category of a toric orbifold is…

Algebraic Geometry · Mathematics 2011-02-08 Bohan Fang , Chiu-Chu Melissa Liu , David Treumann , Eric Zaslow

We show that the dualizing sheaves of reduced simple normal crossings pairs have a canonical weight filtration in a compatible way with the one on the corresponding mixed Hodge modules by calculating the extension classes between the…

Algebraic Geometry · Mathematics 2013-06-25 Osamu Fujino , Taro Fujisawa , Morihiko Saito

Tanaka (1997) proved a powerful generalization of Friedman's self-embedding theorem that states that given a countable nonstandard model $(\mathcal{M},\mathcal{A})$ of the subsystem $\mathrm{WKL}_{0}$ of second order arithmetic, and any…

Logic · Mathematics 2020-02-25 Saeideh Bahrami

We use logarithmic {\ell}-class groups to take a new view on Greenberg's conjecture about Iwasawa {\ell}-invariants of a totally real number field K. By the way we recall and complete some classical results. Under Leopoldt's conjecture, we…

Number Theory · Mathematics 2018-05-03 Jean-François Jaulent

Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…

Computational Complexity · Computer Science 2015-03-17 Samir Datta , Gautam Prakriya

The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…

Complex Variables · Mathematics 2015-11-16 Shin-ichi Matsumura

We develop a theory of toric Artin stacks extending the theories of toric Deligne-Mumford stacks developed by Borisov-Chen-Smith, Fantechi-Mann-Nironi, and Iwanari. We also generalize the Chevalley-Shephard-Todd theorem to the case of…

Algebraic Geometry · Mathematics 2013-01-09 Matthew Satriano

We introduce the notion of a logarithmic stable map from a minimal log prestable curve to a log twisted semi-stable variety of form $xy=0$. We study the compactification of the moduli spaces of such maps and provide a perfect obstruction…

Algebraic Geometry · Mathematics 2009-01-20 Bumsig Kim

We prove that (logarithmic) prismatic and (logarithmic) syntomic cohomology are representable in the category of logarithmic motives. As an application, we obtain Gysin maps for prismatic and syntomic cohomology, and we explicitly identify…

Algebraic Geometry · Mathematics 2026-05-08 Federico Binda , Tommy Lundemo , Alberto Merici , Doosung Park

In 1987, Yomdin proved a lemma on smooth parametrizations of semialgebraic sets as part of his solution of Shub's entropy conjecture for $C^\infty$ maps. The statement was further refined by Gromov, producing what is now known as the…

Algebraic Geometry · Mathematics 2020-09-07 Gal Binyamini , Dmitry Novikov

This work falls within the theory of linear forms in logarithms over a commutative linear group defined over a number field. We give lower bounds for simultaneous linear forms in logarithms of algebraic numbers, treating both the…

Number Theory · Mathematics 2012-06-04 Éric Gaudron

Continuing from arXiv:2102.01917v2, in this paper, we discuss general criteria and forms of liminf laws of iterated logarithm (LIL) for continuous-time Markov processes. Under some minimal assumptions, which are weaker than those in…

Probability · Mathematics 2022-10-11 Soobin Cho , Panki Kim , Jaehun Lee

An LR-structure is a tetravalent vertex-transitive graph together with a special type of a decomposition of its edge-set into cycles. LR-structures were introduced in a paper by P. Poto\v{c}nik and S. Wilson, titled `Linking rings…

Combinatorics · Mathematics 2023-05-24 Marston Conder , Luke Morgan , Primož Potočnik

We show a comparison theorem between log prismatic cohomology and log crystalline cohomology for a $p$-adic formal scheme with semistable reduction. Combined with the prismatic-\'etale comparison theorem recently proved by Tian, this…

Number Theory · Mathematics 2026-03-04 Heng Du , Yong Suk Moon , Koji Shimizu

The embedding theorem arises in several problems from analysis and geometry. The purpose of this paper is to provide a deeper understanding of analysis and geometry with a particular focus on embedding theorems on spaces of homogeneous type…

Classical Analysis and ODEs · Mathematics 2016-01-25 Yanchang Han , Yongsheng Han , Ji Li

To analyze the stability of It\^o stochastic differential equations with multiplicative noise, we introduce the stochastic logarithmic norm. The logarithmic norm was originally introduced by G. Dahlquist in 1958 as a tool to study the…

Numerical Analysis · Computer Science 2008-09-02 Sk. Safique Ahmad , Nagalinga Rajan , Soumyendu Raha

In this paper, a link between polymatroid theory and locally repairable codes (LRCs) is established. The codes considered here are completely general in that they are subsets of $A^n$, where $A$ is an arbitrary finite set. Three classes of…

Information Theory · Computer Science 2015-10-12 Thomas Westerbäck , Ragnar Freij-Hollanti , Camilla Hollanti