English
Related papers

Related papers: Roudneff's Conjecture in Dimension $4$

200 papers

We show the optimal coherence of $2d$ lines in $\mathbb{C}^{d}$ is given by the Welch bound whenever a skew Hadamard of order $d+1$ exists. Our proof uses a variant of Hadamard doubling that converts any equiangular tight frame of size…

Metric Geometry · Mathematics 2023-12-18 Kean Fallon , Joseph W. Iverson

Given a totally nonholonomic distribution of rank two on a three-dimensional manifold we investigate the size of the set of points that can be reached by singular horizontal paths starting from a same point. In this setting, the Sard…

Differential Geometry · Mathematics 2018-07-18 André Belotto da Silva , Ludovic Rifford

In arXiv:0811.1909 Spiridonov and Vartanov, using the superconformal index technique, found that 4-dimensional N=1 SQCD theory with SU(2) gauge group and four flavors has 72 dual representations. Recently in arXiv:1209.1404 the authors…

High Energy Physics - Theory · Physics 2013-07-01 Ilmar Gahramanov , Grigory Vartanov

Suppose that $X$ is a smooth complex algebraic variety of dimension $\geq 3$ and $f$ defines a hypersurface $Z$ in $X$, with a unique singular point $P$. Bitoun and Schedler conjectured that the ${\mathcal D}$-module generated by…

Algebraic Geometry · Mathematics 2023-01-03 Mircea Mustata , Sebastian Olano

In 1991, Kahn made the following conjecture. For any $n$-dimensional vector space $V$ and any $n\times n$ array of $n^2$ bases of $V$, it is possible to choose a representative vector from each of these bases in such a way that the…

Combinatorics · Mathematics 2018-10-18 Matija Bucić , Matthew Kwan , Alexey Pokrovskiy , Benny Sudakov

In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…

Combinatorics · Mathematics 2016-09-05 Peter Frankl , Vojtech Rödl , Andrzej Ruciński

In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\H{o}s on estimating the maximum number of edges…

Combinatorics · Mathematics 2012-02-01 Noga Alon , Peter Frankl , Hao Huang , Vojtech Rodl , Andrzej Rucinski , Benny Sudakov

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

Combinatorics · Mathematics 2009-05-14 Dhruv Mubayi

We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent…

Metric Geometry · Mathematics 2007-05-23 Julian Pfeifle

A long-standing conjecture on spanning trees of a hypercube states that a balanced tree on $2^n$ vertices with maximum degree at most $3$ spans the hypercube of dimension $n$ \cite{havel1986}. In this paper, we settle the conjecture for a…

Combinatorics · Mathematics 2021-10-13 Rishikant Rajdeepak , V. Sunitha

Paul Erdos conjectured that for every n in N, n>1, there exist a, b, c natural numbers, not necessarily distinct, so that 4/n=1/a+1/b+1/c (see \cite{rg}). In this paper we prove an extension of Mordell's theorem and formulate a conjecture…

Number Theory · Mathematics 2010-01-08 Eugen J. Ionascu , Andrew Wilson

In 1994 Drew, Johnson and Loewy conjectured that for $n \ge 4$, the cp-rank of any $n\times n$ completely positive matrices is at most $\lfloor{n^2}/{4}\rfloor$. Recently this conjecture has been proved for $n=5$ and disproved for $n\ge 7$,…

Optimization and Control · Mathematics 2017-06-02 Naomi Shaked-Monderer

An analogue of the Euclidean algorithm for square matrices of size 2 with integral non-negative entries and strictly positive determinant $n$ defines a finite set $\mathcal{R}(n)$ of Euclid-reduced matrices corresponding to elements of…

Number Theory · Mathematics 2022-09-21 Roland Bacher

Let $d\equiv 2\pmod 4$ be a square-free integer such that $x^2 - dy^2 =- 1$ and $x^2 - dy^2 = 6$ are solvable in integers. We prove the existence of infinitely many quadruples in $\mathbb{Z}[\sqrt{d}]$ with the property $D(n)$ when $n \in…

Number Theory · Mathematics 2022-11-10 Kalyan Chakraborty , Shubham Gupta , Azizul Hoque

For n > d/2, the Sobolev (Bessel potential) space H^n(R^d, C) is known to be a Banach algebra with its standard norm || ||_n and the pointwise product; so, there is a best constant K_{n d} such that || f g ||_{n} <= K_{n d} || f ||_{n} || g…

Functional Analysis · Mathematics 2007-05-23 Carlo Morosi , Livio Pizzocchero

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

Algebraic Geometry · Mathematics 2020-07-08 Yiran Cheng

We compute a primary cohomological obstruction to the existence of an equipartition for j mass distributions in R^d by two hyperplanes in the case 2d-3j = 1. The central new result is that such an equipartition always exists if d=6 2^k +2…

Metric Geometry · Mathematics 2014-03-03 Rade T. Zivaljevic

Given a set $V$ of points in $\mathbb R^d$, two points $p$, $q$ from $V$ form a double-normal pair, if the set $V$ lies between two parallel hyperplanes that pass through $p$ and $q$, respectively, and that are orthogonal to the segment…

Combinatorics · Mathematics 2017-12-01 Andrey Kupavskii

We study the dual variants of the Erd\H{o}s's distinct distances and unit distance problems. Instead of considering distances determined by points, we consider simplex volumes determined by hyperplanes. We investigate: (1) the maximum…

Combinatorics · Mathematics 2026-03-11 Koki Furukawa

We show that the maximal determinant D(n) for $n \times n$ ${\pm 1}$-matrices satisfies $R(n) := D(n)/n^{n/2} \ge \kappa_d > 0$. Here $n^{n/2}$ is the Hadamard upper bound, and $\kappa_d$ depends only on $d := n-h$, where $h$ is the maximal…

Combinatorics · Mathematics 2013-05-07 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith
‹ Prev 1 4 5 6 7 8 10 Next ›