中文
相关论文

相关论文: Integer Triangles with R/r=N

200 篇论文

We consider tilings of a triangle $ABC$ by congruent copies of a triangle that has one angle equal to $120^\circ$, has non-commensurable angles (that is, not all angles are rational multiples of $\pi$), and is not similar to $ABC$. We prove…

组合数学 · 数学 2026-04-03 Michael Beeson , Yan X Zhang

We prove that the number of integers in the interval [0,x] that are non-trivial Ramsey numbers r(k,n) (3 <= k <= n) has order of magnitude (x ln x)**(1/2).

组合数学 · 数学 2014-11-11 Lane Clark , Frank Gaitan

For two positive integers $r$ and $s$ with $r\geq 2s-2$, if $G$ is a graph of order $3r+4s$ such that $d(x)+d(y)\geq 4r+4s$ for every $xy\not\in E(G)$, then $G$ independently contains $r$ triangles and $s$ quadrilaterals, which partially…

组合数学 · 数学 2011-11-16 Xin Zhang , Jian-Liang Wu , Jin Yan

The results obtained in paper I are used to study possible relationships between the truncation radius of stellar discs in the NIR and structural parameters of the galaxies. The NIR truncation radius is larger for brighter galaxies, being…

天体物理学 · 物理学 2009-01-14 E. Florido , E. Battaner , A. Guijarro , F. Garzon , A. Castillo-Morales

Let $G = (V, E)$ be an $n$-vertex edge-colored graph. In 2013, H. Li proved that if every vertex $v \in V$ is incident to at least $(n+1)/2$ distinctly colored edges, then $G$ admits a rainbow triangle. We prove that the same hypothesis…

组合数学 · 数学 2021-02-24 Andrzej Czygrinow , Theodore Molla , Brendan Nagle , Roy Oursler

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.

组合数学 · 数学 2007-05-23 Alexander Below , Jesús A. De Loera , Jürgen Richter-Gebert

We address the problem of computing the minimum number of triangles to separate a set of blue points from a set of red points in $\mathbb{R}^2$. A set of triangles is a \emph{separator} of one color from the other if every point of that…

计算几何 · 计算机科学 2025-03-10 Helena Bergold , Arun Kumar Das , Robert Lauff , Manfred Scheucher , Felix Schröder , Marie Diana Sieper

A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…

组合数学 · 数学 2024-11-19 E. Alkin , E. Bordacheva , A. Miroshnikov , O. Nikitenko , A. Skopenkov

If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…

历史与综述 · 数学 2016-02-10 Jesús Álvarez Lobo

The super-critical Brezis-Nirenberg problem in an annulus is considered. The new uniqueness result of positive radial solutions is established for the three-dimensional case. It is also proved that the problem has at least three positive…

偏微分方程分析 · 数学 2025-07-09 Naoki Shioji , Satoshi Tanaka , Kohtaro Watanabe

The question of which triangular numbers have a decimal representation containing a single repeated digit seamed to be settled since at least the 1970s: Ballew and Weger provided a complete list and a proof that these are the only numbers…

数论 · 数学 2025-06-03 Christian Hercher , Karl Fegert

Given a triangle ABC, we derive the probability distribution function and the moments of the area of an inscribed triangle RST whose vertices are uniformly distributed on AB, BC, and CA. The theoretical results are confirmed by a Monte…

综合数学 · 数学 2018-05-01 Arman Maesumi

Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…

Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used…

组合数学 · 数学 2016-12-06 Fyodor Sharov

Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…

组合数学 · 数学 2021-11-10 Stephen Wolfram

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

组合数学 · 数学 2018-05-22 Toufik Mansour , Madjid Mirzavaziri , Daniel Yaqubi

In this paper, we exploit the r-Stirling numbers of both kinds in order to give explicit formulae for the values of the high order Bernoulli numbers and polynomials of both kinds at integers. We give also some identities linked the…

数论 · 数学 2014-01-24 Miloud Mihoubi , Meriem Tiachachat

A famous conjecture of Ryser is that in an $r$-partite hypergraph the covering number is at most $r-1$ times the matching number. If true, this is known to be sharp for $r$ for which there exists a projective plane of order $r-1$. We show…

组合数学 · 数学 2015-12-31 Ron Aharoni , János Barát , Ian M. Wanless

In this paper, we consider a set of similar triangles with parallel sides, along with a set of points in the plane. It turns out that the set $\mathbb{R}_2= \{\pm <x >=\pm (x^2,x,1); x\in\mathbb{R} \}$ describes this set of triangles quite…

度量几何 · 数学 2025-09-18 Edward Mieczkowski

In this paper, we investigate the existence of Sierpi\'{n}ski numbers and Riesel numbers as binomial coefficients. We show that for any odd positive integer $r$, there exist infinitely many Sierpi\'{n}ski numbers and Riesel numbers of the…