中文
相关论文

相关论文: A Mad Q-set

200 篇论文

Quasi *-algebras possessing a sufficient family $\mathcal{M}$ of invariant positive sesquilinear forms carry several topologies related to $\mathcal{M}$ which make every *-representation continuous. This leads to define the class of locally…

泛函分析 · 数学 2023-04-13 Giorgia Bellomonte , Camillo Trapani

A More Sums Than Difference (MSTD) set is a finite set of integers $A$ where the cardinality of its sumset, $A+A$, is greater than the cardinality of its difference set, $A-A$. Since addition is commutative while subtraction isn't, it was…

In this paper, we study the following classical question of extremal set theory: what is the maximum size of a family of subsets of $[n]$ such that no $s$ sets from the family are pairwise disjoint? This problem was first posed by Erd\H os…

组合数学 · 数学 2018-08-06 Peter Frankl , Andrey Kupavskii

A set $A$ is MSTD (more-sum-than-difference) or sum-dominant if $|A+A|>|A-A|$, and is RSD (restricted-sum dominant) if $|A\hat{+}A|>|A-A|$, where $A\hat{+}A$ is the set of sums of distinct elements in $A$. We study an interesting family of…

数论 · 数学 2019-08-20 Hung Viet Chu , Noah Luntzlara , Steven J. Miller , Lily Shao

A $\lambda$-quiddity of size $n$ is an $n$-tuple of elements from a fixed set, which is a solution to a matrix equation that arises in the study of Coxeter's friezes. The study of these solutions involves in particular the use of a notion…

组合数学 · 数学 2025-03-10 Flavien Mabilat

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

数值分析 · 数学 2025-07-16 H. Hakopian , G. Vardanyan , N. Vardanyan

It is well known that an intersecting family of subsets of an n-element set can contain at most 2^(n-1) sets. It is natural to wonder how `close' to intersecting a family of size greater than 2^(n-1) can be. Katona, Katona and Katona…

组合数学 · 数学 2011-08-30 Paul A. Russell , Mark Walters

Let $V$ be an $n$-dimensional vector space over a finite field $\mathbb{F}_q$. In this paper we describe the structure of maximal non-trivial $t$-intersecting families of $k$-dimensional subspaces of $V$ with large size. We also determine…

组合数学 · 数学 2020-07-24 Mengyu Cao , Benjian Lv , Kaishun Wang , Sanming Zhou

A starting point in the investigation of intersecting systems of subsets of a finite set is the elementary observation that the size of a family of pairwise intersecting subsets of a finite set [n]={1,...,n}, denoted by 2^{[n]}, is at most…

组合数学 · 数学 2017-03-03 Eva Czabarka , Glenn Hurlbert , Vikram Kamat

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Define $A + A := \{a + b : a, b \in A\}$ and $A \dotplus A := \{a + b : a, b \in A~\text{and}~ a \neq b\}$. The set $A$ is called a {\em sum-dominant (SD) set} if $|A +…

数论 · 数学 2017-12-27 Raj Kumar Mistri , R. Thangadurai

The hypercube Q_n is the graph whose vertex set is {0,1}^n and where two vertices are adjacent if they differ in exactly one coordinate. For any subgraph H of the cube, let ex(Q_n, H) be the maximum number of edges in a subgraph of Q_n…

组合数学 · 数学 2010-05-05 David Conlon

Under MA_{omega_1} every uncountable almost disjoint family is either anti-Luzin or has an uncountable Luzin subfamily. This fails under CH. Related properties are also investigated.

逻辑 · 数学 2016-09-07 Judith Roitman , Lajos Soukup

Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are…

几何拓扑 · 数学 2007-05-23 Panos Papazoglu , Kevin Whyte

Separating hash families are useful combinatorial structures which generalize several well-studied objects in cryptography and coding theory. Let $p_t(N, q)$ denote the maximum size of universe for a $t$-perfect hash family of length $N$…

组合数学 · 数学 2023-10-31 Xin Wei , Xiande Zhang , Gennian Ge

For $k\geq3$, a collection of $k$ sets is said to form a \emph{weak $\Delta$-system} if the intersection of any two sets from the collection has the same size. Erd\H{o}s and Szemer\'{e}di asked about the size of the largest family…

组合数学 · 数学 2023-01-24 Eric Naslund

Let $X$ be a topological space and $f:X\to X$ a bijection. Let ${\mathcal C}(X,f)$ be a set of integers such that an integer $n$ is an element of ${\mathcal C}(X,f)$ if and only if the bijection $f^n:X\to X$ is continuous. A subset $S$ of…

几何拓扑 · 数学 2013-10-30 Kouki Taniyama

A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…

Let K be a set of infinite cardinals such that the cardinality of K is the first strong limit cardinal greater than uncountably many strong limit cardinals. We construct a family of pairwise non-embeddable groups which contains 2^k groups…

群论 · 数学 2026-01-08 Gerald Kuba

We investigate families of subsets of $\omega$ with almost disjoint refinements in the classical case as well as with respect to given ideals on $\omega$. More precisely, we study the following topics and questions: 1) Examples of…

逻辑 · 数学 2015-10-21 Barnabás Farkas , Yurii Khomskii , Zoltán Vidnyánszky

Every element $u$ of $[0,1]$ can be written in the form $u=x^2y$, where $x,y$ are elements of the Cantor set $C$. In particular, every real number between zero and one is the product of three elements of the Cantor set. On the other hand…

度量几何 · 数学 2017-11-27 Jayadev S. Athreya , Bruce Reznick , Jeremy T. Tyson
‹ 上一页 1 8 9 10 下一页 ›