English
Related papers

Related papers: On boundedness of divisors computing minimal log d…

200 papers

We prove that the non-vanishing conjecture and the log minimal model conjecture for projective log canonical pairs can be reduced to the non-vanishing conjecture for smooth projective varieties such that the boundary divisor is zero.

Algebraic Geometry · Mathematics 2017-11-22 Kenta Hashizume

A long-standing Conjecture of S. Negami states that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It is known that the Conjecture is equivalent to the fact that \emph{the graph $K_{1,2, 2, 2}$…

Combinatorics · Mathematics 2024-12-30 Dickson Annor , Yuri Nikolayevsky , Michael Payne

Shokurov conjectured that the set of all log canonical thresholds on varieties of bounded dimension satisfies the ascending chain condition. In this paper we prove that the conjecture holds for log canonical thresholds on smooth varieties…

Algebraic Geometry · Mathematics 2019-12-19 Tommaso de Fernex , Lawrence Ein , Mircea Mustata

Motivated by a hat guessing problem proposed by Iwasawa \cite{Iwasawa10}, Butler and Graham \cite{Butler11} made the following conjecture on the existence of certain way of marking the {\em coordinate lines} in $[k]^n$: there exists a way…

Combinatorics · Mathematics 2011-11-28 Tengyu Ma , Xiaoming Sun , Huacheng Yu

Let $\Gamma$ be a group acting on a set $X$. The distinguishing number for this action of $\Gamma$ on $X$, denoted by $D_{\Gamma}(X)$, is the smallest natural number $k$ such that the elements of $X$ can be labeled with $k$ labels so that…

Combinatorics · Mathematics 2017-01-03 Saeid Alikhani , Samaneh Soltani

We consider the following extension of the concept of adjacent strong edge colourings of graphs without isolated edges. Two distinct vertices which are at distant at most $r$ in a graph are called $r$-adjacent. The least number of colours…

Combinatorics · Mathematics 2018-03-13 Jakub Przybyło

Let $G$ be a permutation group on a finite set $\Omega$. A subset $B \subseteq \Omega$ is a base for $G$ if the pointwise stabilizer of $B$ in $G$ is trivial. The base size of $G$, denoted $b(G)$, is the smallest size of a base. A well…

Group Theory · Mathematics 2013-11-19 Timothy Burness , Ákos Seress

A set $S$ of vertices in a graph $G$ is a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in~$S$. An independent dominating set in $G$ is a dominating set of $G$ with the additional property that it is an…

Combinatorics · Mathematics 2025-10-17 Boštjan Brešar , Tanja Dravec , Michael A. Henning

Let $G$ be a finite group and denote by $o(g)$ the order of an element $g\in G$. We say that $G$ is an $LCM$-group if $o(x^ny)$ is a divisor of the least common multiple of $o(x^n)$ and $o(y)$ for all $x, y\in G$ and $n\in\mathbb{N}$. This…

Group Theory · Mathematics 2026-02-09 Mihai-Silviu Lazorec

We prove a conjecture of Dukes and Herke concerning the possible orders of a basis for the cyclic group Z_n, namely : For each k \in N there exists a constant c_k > 0 such that, for all n \in N, if A \subseteq Z_n is a basis of order…

Number Theory · Mathematics 2009-07-04 Peter Hegarty

Let $G_{n,\gamma}$ be the set of all connected graphs on $n$ vertices with domination number $\gamma$. A graph is called a minimizer graph if it attains the minimum spectral radius among $G_{n,\gamma}$. Very recently, Liu, Li and Xie…

Combinatorics · Mathematics 2023-07-31 Yarong Hu , Zhenzhen Lou , Qiongxiang Huang

Recently, Gross et al. posed the LLC conjecture for the locally log-concavity of the genus distribution of every graph, and provided an equivalent combinatorial version, the CLLC conjecture, on the log-concavity of the generating function…

Combinatorics · Mathematics 2015-11-11 Jonathan L. Gross , Toufik Mansour , Thomas W. Tucker , David G. L. Wang

We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…

Optimization and Control · Mathematics 2013-08-30 Julien M. Hendrickx , Raphaël M. Jungers , Alexander Olshevsky , Guillaume Vankeerberghen

As part of the graph minor project, Robertson and Seymour showed in 1990 that the class of graphs that can be embedded in a given surface can be characterized by a finite set of minimal excluded minors. However, their proof, because…

Combinatorics · Mathematics 2026-04-06 Sarah Houdaigoui , Ken-ichi Kawarabayashi

We study special linear systems of surfaces of $\mathbb{P}^3$ interpolating nine points in general position having a quadric as fixed component. By performing degenerations in the blown-up space, we interpret the quadric obstruction in…

Algebraic Geometry · Mathematics 2015-10-01 Maria Chiara Brambilla , Olivia Dumitrescu , Elisa Postinghel

We give an upper bound for the minimal discrepancies of hypersurface singularities. As an application, we show that Shokurov's conjecture is true for log-terminal threefolds.

alg-geom · Mathematics 2007-05-23 Vladimir Masek

Assume $\lambda=\{k_1,k_2, \ldots, k_q\}$ is a partition of $k_{\lambda} = \sum_{i=1}^q k_i$. A $\lambda$-list assignment of $G$ is a $k_\lambda$-list assignment $L$ of $G$ such that the colour set $\bigcup_{v \in V(G)}L(v)$ can be…

Combinatorics · Mathematics 2022-09-16 Yangyan Gu , Yiting Jiang , David R. Wood , Xuding Zhu

We develop a new approach towards obtaining lower bounds of the Seshadri constants of ample adjoint divisors on smooth projective varieties $X$ in arbitrary characteristic. Let $x\in X$ be a closed point and $A$ an ample divisor on $X$. If…

Algebraic Geometry · Mathematics 2026-01-27 Linus Rösler

We prove that the first gap of $\mathbb R$-complementary thresholds of surfaces is $\frac{1}{13}$. More precisely, the largest $\mathbb R$-complementary threshold for surfaces that is strictly less than $1$ is $\frac{12}{13}$. This result…

Algebraic Geometry · Mathematics 2023-05-31 Jihao Liu , V. V. Shokurov

The Komlos conjecture in discrepancy theory states that for some constant K and for any m by n matrix A whose columns lie in the unit ball there exists a +/- 1 vector x such that the infinity norm of Ax is bounded above by K. This…

Combinatorics · Mathematics 2013-08-05 Aleksandar Nikolov
‹ Prev 1 4 5 6 7 8 10 Next ›