English
Related papers

Related papers: Chessboard complexes indomitable

200 papers

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman

The main result of this paper is a proof of the following conjecture of Babson & Kozlov: Theorem. Let G be a graph of maximal valency d, then the complex Hom(G,K_n) is at least (n-d-2)-connected. Here Hom(-,-) denotes the polyhedral complex…

Combinatorics · Mathematics 2007-05-23 Sonja Lj. Cukic , Dmitry N. Kozlov

In this paper we prove the smoothness of the moduli space of Landau-Ginzburg models. We formulate and prove a Tian-Todorov theorem for the deformations of Landau-Ginzburg models, develop the necessary Hodge theory for varieties with…

Algebraic Geometry · Mathematics 2014-10-07 Ludmil Katzarkov , Maxim Kontsevich , Tony Pantev

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…

By Kolmogorov Complexity,two number-theoretic problems are solved in different way than before,one problem is Maxim Kontsevich and Don Bernard Zagier's Problem 3 \emph{Exhibit at least one number which does not belong to} $ \mathcal{P}$…

Number Theory · Mathematics 2016-10-24 Yang Bai , Xiuli Wang

Denote by $\Delta_M$ the $M$-dimensional simplex. A map $f\colon \Delta_M\to\mathbb R^d$ is an almost $r$-embedding if $f\sigma_1\cap\ldots\cap f\sigma_r=\emptyset$ whenever $\sigma_1,\ldots,\sigma_r$ are pairwise disjoint faces. A…

Geometric Topology · Mathematics 2026-01-08 S. Avvakumov , R. Karasev , A. Skopenkov

The paper offers versions of Hilbert's Irreducibility Theorem for the lifting of points in a cyclic subgroup of an algebraic group to a ramified cover. A version of Bertini Theorem in this context is also obtained.

Number Theory · Mathematics 2019-12-19 Umberto Zannier

The famous conjecture of V.Ya.Ivrii (1978) says that {\it in every billiard with infinitely-smooth boundary in a Euclidean space the set of periodic orbits has measure zero}. In the present paper we study the complex version of Ivrii's…

Dynamical Systems · Mathematics 2013-09-10 Alexey Glutsyuk

Let $(\mathfrak{g},[p])$ be a finite dimensional restricted Lie algebra over a perfect field $\mathbbm{k}$ of characteristic $p\!\ge \!3$. By combining methods from recent work of Benson-Carlson \cite{BC20} with those of \cite{CF21,Fa17} we…

Representation Theory · Mathematics 2023-05-16 Hao Chang , Rolf Farnsteiner

Let $(a,a+d,a+2d)$ be an arithmetic progression of positive integers. The following statements are proved: (1) If $a\mid 2d$, then $(a, a+d, a+2d)\in\mdeg(\Tame(\mathbb{C}^3))$. (2) If $a\nmid 2d$, then, except for arithmetic progressions…

Commutative Algebra · Mathematics 2011-12-30 Jiantao Li , Xiankun Du

In this paper outer, or dual, billiards outside regular polygons are studied; in particular, periodic points for cases of strictly convex "tables" and for regular n-gons with n = 3,4,6,8,12 are discussed. The main results of the paper are:…

Dynamical Systems · Mathematics 2017-11-27 Filipp Rukhovich

There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture -- correctness of a strategy…

Logic in Computer Science · Computer Science 2023-06-22 Predrag Janičić , Filip Marić , Marko Maliković

In how many ways can $n$ queens be placed on an $n \times n$ chessboard so that no two queens attack each other? This is the famous $n$-queens problem. Let $Q(n)$ denote the number of such configurations, and let $T(n)$ be the number of…

Combinatorics · Mathematics 2017-05-17 Zur Luria

In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…

Combinatorics · Mathematics 2013-06-03 Sinisa Vrecica , Rade Zivaljevic

We describe a series of complexes that relate to the braid groups as the matching complexes relate to the symmetric groups. A modified construction applies as well to other complexes based on edge sets in graphs. We show that our…

Geometric Topology · Mathematics 2007-05-23 Kai-Uwe Bux

We improve the result by Feola and Iandoli [J. de Math. Pures et App., 157:243-281, 2022], showing that quasilinear Hamiltonian Schr\"odinger type equations are well posed on $H^s(\mathbb{T}^d)$ if $s>d/2+3$. We exploit the sharp…

Analysis of PDEs · Mathematics 2023-09-13 Felice Iandoli

We prove a Tverberg-type theorem using the probabilistic method. Given $\varepsilon >0$, we find the smallest number of partitions of a set $X$ in $R^d$ into $r$ parts needed in order to induce at least one Tverberg partition on every…

Combinatorics · Mathematics 2018-06-12 Pablo Soberón

We develop a new method to solve the irreducible character problem for a wide class of modules over the general linear superalgebra, including all the finite-dimensional modules, by directly relating the problem to the classical…

Representation Theory · Mathematics 2015-05-13 Shun-Jen Cheng , Ngau Lam

We prove here that in the Theorem on Local Ergodicity for Semi-Dispersive Billiards (proved by N. I. Chernov and Ya. G. Sinai in 1987) the recently added condition (by P. B\'alint, N. Chernov, D. Sz\'asz, and I. P. T\'oth, in order to save…

Dynamical Systems · Mathematics 2010-08-11 Nandor Simanyi

Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…

Computational Geometry · Computer Science 2015-05-28 Wolfgang Mulzer , Yannik Stein
‹ Prev 1 8 9 10 Next ›