English
Related papers

Related papers: A note on three dimensional good sets

200 papers

We show that in n-fold cartesian product, n >= 4, a related component need not be a full component. We also prove that when n >= 4, uniform boundedness of lengths of geodesics is not a necessary condition for boundedness of solutions of (1)…

Functional Analysis · Mathematics 2007-07-16 K Gowri Navada

We propose here a multidimensional generalisation of the notion of link introduced in our previous papers and we discuss some consequences for simplicial measures and sums of function algebras.

Combinatorics · Mathematics 2007-05-23 A Klopotowski , M G Nadkarni , K P S Bhaskara Rao

In a triangulated category, cofibre fill-ins always exist. Neeman showed that there is always at least one "good" fill-in, i.e., one whose mapping cone is exact. Verdier constructed a fill-in of a particular form in his proof of the $4…

Algebraic Topology · Mathematics 2023-01-10 J. Daniel Christensen , Martin Frankland

We say that a set is a multiplicative 3-Sidon set if the equation $s_1s_2s_3=t_1t_2t_3$ does not have a solution consisting of distinct elements taken from this set. In this paper we show that the size of a multiplicative 3-Sidon subset of…

Number Theory · Mathematics 2018-01-29 Péter Pál Pach

It is well known that in $n$-dimensional Euclidean space ($n\geq 2$) the classes of (diametrically) complete sets and of bodies of constant width coincide. Due to this, they both form a proper subfamily of the class of reduced bodies. For…

Metric Geometry · Mathematics 2018-02-27 Horst Martini , Senlin Wu

It is shown that (1) if a good set has finitely many related components, then they are full, (2) loops correspond one-to-one to extreme points of a convex set. Some other properties of good sets are discussed.

General Mathematics · Mathematics 2007-05-23 K Gowri Navada

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

Combinatorics · Mathematics 2025-01-06 William Gasarch , James Glenn , Clyde Kruskal

We show that a proper algebraic n-dimensional scheme Y admits nontrivial vector bundles of rank n, even if Y is non-projective, provided that there is a modification containing a projective Cartier divisor that intersects the exceptional…

Algebraic Geometry · Mathematics 2015-08-25 Markus Perling , Stefan Schroeer

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

Group Theory · Mathematics 2008-04-07 Kiran S. Kedlaya , Xuancheng Shao

In this note, we construct an example of a sequence of $n$-fold product chains which does not display cutoff for total-variation distance neither for separation distance. In addition we show that this type of product chains necessarily…

Probability · Mathematics 2014-12-01 Hubert Lacoin

A subset of a group is said to be product-free if it does not contain three elements satisfying the equation $xy=z$. We give a negative answer to a question of Babai and S\'os on the existence of large product-free sets by model theoretic…

Group Theory · Mathematics 2019-07-31 Daniel Palacín

We prove that the zero set of a 4-nomial in n variables in the positive orthant has at most three connected components. This bound, which does not depend on the degree of the polynomial, not only improves the best previously known bound…

Algebraic Geometry · Mathematics 2007-05-23 Daniel Perrucci

We develop a general theory of Cartesian and non-Cartesian polynomials on products of complex spaces $\mathbb{C}^{n_1} \times \cdots \times \mathbb{C}^{n_k}$. We prove that, for any fixed degree $d \ge 2$, a (Zariski) generic polynomial is…

Algebraic Geometry · Mathematics 2026-05-22 Chun-Yen Shen , Tuyen Trung Truong , Wei-Hsuan Yu

Using standard results from higher (secondary) index theory, we prove that the positive scalar curvature bordism groups of a cartesian product GxZ are infinite in dimension 4n if n>0 G a group with non-trivial torsion. We construct…

Geometric Topology · Mathematics 2024-02-16 Paolo Piazza , Thomas Schick , Vito Felice Zenobi

An important question in the study of quasi-perfect codes is whether such codes can be constructed for all possible lengths $n$. In this paper, we address this question for specific values of $n$. First, we investigate the existence of…

Combinatorics · Mathematics 2025-10-16 S. A. Mane , N. V. Shinde

Let $k \geq 1$ be an integer. A set $A \subset \mathbb{Z}$ is a $k$-fold Sidon set if $A$ has only trivial solutions to each equation of the form $c_1 x_1 + c_2 x_2 + c_3 x_3 + c_4 x_4 = 0$ where $0 \leq |c_i | \leq k$, and $c_1 + c_2 + c_3…

Combinatorics · Mathematics 2013-12-18 Javier Cilleruelo , Craig Timmons

For a 4th order 3-dimensional cyclic symmetric tensor, a sufficient and necessary condition is bulit for its positive semi-definiteness. A sufficient and necessary condition of positive definiteness is showed for a 4th order $n$-dimensional…

Optimization and Control · Mathematics 2024-09-04 Yisheng Song

We generalise the notions of good, middling good, and Verdier good morphisms of distinguished triangles in triangulated categories, first introduced by Neeman, to the setting of $n$-angulated categories, introduced in Geiss, Keller, and…

Category Theory · Mathematics 2023-08-14 Sebastian H. Martensen

We prove the strong form of the Gaussian product conjecture in dimension three. Our purely analytical proof simplifies previously known proofs based on combinatorial methods or computer-assisted methods, and allows us to solve the case of…

Probability · Mathematics 2024-06-21 Ronan Herry , Dominique Malicet , Guillaume Poly

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} +…

Combinatorics · Mathematics 2010-10-26 Michael E. Picollelli
‹ Prev 1 2 3 10 Next ›