中文
相关论文

相关论文: On distinct cross-ratios and related growth proble…

200 篇论文

It is known that in the lattice of normal extensions of the logic KTB there are unique logics of codimensions 1 and 2, namely, the logic of a single reflexive point, and the logic of the total relation on two points. A natural question…

逻辑 · 数学 2021-10-19 James Koussas , Tomasz Kowalski , Yutaka Miyazaki , Michael Stevens

Let $\mathcal{E}$ be the $\sigma$-ideal generated by the closed measure zero sets of reals. We use an ultrafilter-extendable matrix iteration of ccc posets to force that, for $\mathcal{E}$, their associated cardinal characteristics (i.e.\…

逻辑 · 数学 2022-06-30 Miguel A. Cardona

Let $(G, +)$ be an abelian group. In 2004, Eliahou and Kervaire found an explicit formula for the smallest possible cardinality of the sumset $A+A$, where $A \subseteq G$ has fixed cardinality $r$. We consider instead the smallest possible…

组合数学 · 数学 2017-03-30 Mitchell Lee

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

计算机科学中的逻辑 · 计算机科学 2014-11-04 Danko Ilik

We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…

概率论 · 数学 2023-12-11 Miklós Abert , Mikołaj Frączyk , Ben Hayes

The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number of crossings in a rectilinear nondegenerate planar drawing…

The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise-distinct vertices from the set lie on a common shortest path. In this paper it is proved that the general position…

组合数学 · 数学 2023-06-22 Jing Tian , Kexiang Xu , Sandi Klavžar

It is shown that, for any pair of cardinals with infinite sum, there exist a group and an equation over this group such that the first cardinal is the number of solutions to this equation and the second cardinal is the number of…

群论 · 数学 2007-05-23 Anton A. Klyachko , Anton V. Trofimov

Line systems passing through the origin of the $d$ dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least $2(d-1)(d-2)$, and this…

度量几何 · 数学 2019-10-15 Mikhail Ganzhinov , Ferenc Szöllősi

Let $\mathbf{x}$ be a (non-empty) sequence of positive real numbers. Its achievement set $\mathcal{\mathbf{x}}$ is the set of all the possible sums of the elements of $\mathbf{x}$. The cardinal function of $\mathbf{x}$ is the function…

经典分析与常微分方程 · 数学 2025-08-19 Jacek Marchwicki , Błażej Żmija

Let $f,g \in k[x]$ be nonconstant polynomials over a number field $k$. We count $S$-integer inputs $a$ for which $f(a)$ has a $k$-rational preimage under $g$, after removing the polynomial graph components $Y=h(X)$ with $f=g\circ h$. The…

数论 · 数学 2026-05-14 Henry Shin

A natural generating set for a Galois extension regarded as the splitting field of an irreducible polynomial is introduced and investigated here. Minimal generating sets arising in this context throw many surprises compared to the analogous…

数论 · 数学 2026-01-07 Shubham Jaiswal , P Vanchinathan

Let $R$ be a subring of $\mathbb{C}[[z]]$, and let $X \in \mathbb{C}[[z]]$. The Newton-Puiseux Theorem implies that if the coefficients of $X$ grow sufficiently rapidly relative to the coefficients of the series in $R$, then $X$ is…

数论 · 数学 2021-03-08 Robert Dawson , Grant Molnar

The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in $R^k$. In this article, we give estimates on…

组合数学 · 数学 2013-05-23 L. Sunil Chandran , Wilfried Imrich , Rogers Mathew , Deepak Rajendraprasad

We study the problem of estimating the number of points of coincidences of an idealized gap on the set of integers under a given multiplicative function $g:\mathbb{N}\longrightarrow \mathbb{C}$ respectively additive function…

数论 · 数学 2026-04-21 Theophilus Agama

A generating set $S$ for a group $G$ is independent if the subgroup generated by $S\setminus \{s\}$ is properly contained in $G$, for all $s \in S.$ In this paper, we study a problem proposed by Peter Glasby: we investigate finite groups,…

群论 · 数学 2022-12-07 Andrea Lucchini , Pablo Spiga

We consider the problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$. It is proved that it is sufficient, in a certain sense, to consider the interval…

组合数学 · 数学 2020-10-12 Aliaksei Semchankau

The two outer triangular caustics (regions of infinite magnification) of a close binary microlens move much faster than the components of the binary themselves, and can even exceed the speed of light. When $\epsilon > 1$, where $\epsilon c$…

天体物理学 · 物理学 2009-10-31 Zheng Zheng , Andrew Gould

Given a set $X$ of $n\times n$ matrices and a positive integer $m$, we consider the problem of estimating the cardinalities of the product sets $A_1 \dotsc A_m$, where $A_i\in X$. When $X=\mathcal M_n(\mathbb{Z};H)$, the set of $n\times n$…

数论 · 数学 2024-11-20 Muhammad Afifurrahman

Given a subset $W$ of an abelian group $G$, a subset $C$ is called an additive complement for $W$ if $W+C=G$; if, moreover, no proper subset of $C$ has this property, then we say that $C$ is a minimal complement for $W$. It is natural to…

组合数学 · 数学 2021-01-01 Noga Alon , Noah Kravitz , Matt Larson
‹ 上一页 1 8 9 10 下一页 ›