An Infinite Set of Heron Triangles with Two Rational Medians

1997 ◽  
Vol 104 (2) ◽  
pp. 107-115 ◽  
Author(s):  
Ralph H. Buchholz ◽  
Randall L. Rathbun
Keyword(s):  
Infinite Set

scholarly journals A Note on On-Line Ramsey Numbers for Some Paths

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 735
Author(s):  
Tomasz Dzido ◽  
Renata Zakrzewska
Keyword(s):  
Ramsey Number ◽  
Ramsey Numbers ◽  
Minimum Number ◽  
On Line ◽  
Infinite Set ◽  
Do So

We consider the important generalisation of Ramsey numbers, namely on-line Ramsey numbers. It is easiest to understand them by considering a game between two players, a Builder and Painter, on an infinite set of vertices. In each round, the Builder joins two non-adjacent vertices with an edge, and the Painter colors the edge red or blue. An on-line Ramsey number r˜(G,H) is the minimum number of rounds it takes the Builder to force the Painter to create a red copy of graph G or a blue copy of graph H, assuming that both the Builder and Painter play perfectly. The Painter’s goal is to resist to do so for as long as possible. In this paper, we consider the case where G is a path P4 and H is a path P10 or P11.

Density of sets with missing differences and applications

2021 ◽  
Vol 71 (3) ◽  
pp. 595-614
Author(s):  
Ram Krishna Pandey ◽  
Neha Rai
Keyword(s):  
Number Theory ◽  
Asymptotic Density ◽  
Theory Problem ◽  
Distance Graphs ◽  
Positive Integers ◽  
Infinite Set

Abstract For a given set M of positive integers, a well-known problem of Motzkin asks to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers in which no two elements differ by an element in M. In 1973, Cantor and Gordon find μ(M) for |M| ≤ 2. Partial results are known in the case |M| ≥ 3 including some results in the case when M is an infinite set. Motivated by some 3 and 4-element families already discussed by Liu and Zhu in 2004, we study μ(M) for two families namely, M = {a, b,a + b, n(a + b)} and M = {a, b, b − a, n(b − a)}. For both of these families, we find some exact values and some bounds on μ(M). This number theory problem is also related to various types of coloring problems of the distance graphs generated by M. So, as an application, we also study these coloring parameters associated with these families.

scholarly journals Time and Life in the Relational Universe: Prolegomena to an Integral Paradigm of Natural Philosophy

Philosophies ◽  
2018 ◽  
Vol 3 (4) ◽  
pp. 30 ◽  
Author(s):  
Abir Igamberdiev
Keyword(s):  
Probability Function ◽  
Natural Philosophy ◽  
Natural World ◽  
Spatiotemporal Structure ◽  
Internal Logic ◽  
Decision Making System ◽  
Relational Domains ◽  
Relational Order ◽  
Infinite Set ◽  
The Universe

Relational ideas for our description of the natural world can be traced to the concept of Anaxagoras on the multiplicity of basic particles, later called “homoiomeroi” by Aristotle, that constitute the Universe and have the same nature as the whole world. Leibniz viewed the Universe as an infinite set of embodied logical essences called monads, which possess inner view, compute their own programs and perform mathematical transformations of their qualities, independently of all other monads. In this paradigm, space appears as a relational order of co-existences and time as a relational order of sequences. The relational paradigm was recognized in physics as a dependence of the spatiotemporal structure and its actualization on the observer. In the foundations of mathematics, the basic logical principles are united with the basic geometrical principles that are generic to the unfolding of internal logic. These principles appear as universal topological structures (“geometric atoms”) shaping the world. The decision-making system performs internal quantum reduction which is described by external observers via the probability function. In biology, individual systems operate as separate relational domains. The wave function superposition is restricted within a single domain and does not expand outside it, which corresponds to the statement of Leibniz that “monads have no windows”.

XLIX.—Generalizations of a Problem of Pillai

1949 ◽  
Vol 62 (4) ◽  
pp. 460-469
Author(s):  
L. Mirsky
Keyword(s):  
Asymptotic Formula ◽  
Error Term ◽  
Main Concern ◽  
Positive Integers ◽  
Infinite Set

I. Throughout this paper k1, …, k3 will denote s ≥ I fixed distinct positive integers. Some years ago Pillai (1936) found an asymptotic formula, with error term O(x/log x), for the number of positive integers n ≤ x such that n + k1, …, n + k3 are all square-free. I recently considered (Mirsky, 1947) the corresponding problem for r-free integers (i.e. integers not divisible by the rth power of any prime), and was able, in particular, to reduce the error term in Pillai's formula.Our present object is to discuss various generalizations and extensions of Pillai's problem. In all investigations below we shall be concerned with a set A of integers. This is any given, finite or infinite, set of integers greater than 1 and subject to certain additional restrictions which will be stated later. The elements of A will be called a-numbers, and the letter a will be reserved for them. A number which is not divisible by any a-number will be called A-free, and our main concern will be with the study of A-free numbers. Their additive properties have recently been investigated elsewhere (Mirsky, 1948), and some estimates obtained in that investigation will be quoted in the present paper.

The solution of an infinite set of differential-difference equations occurring in polymerization and queueing problems

1963 ◽  
Vol 59 (1) ◽  
pp. 117-124 ◽  
Author(s):  
A. Wragg
Keyword(s):  
Difference Equations ◽  
Queueing Theory ◽  
Bessel Functions ◽  
Formal Solution ◽  
Monomer Concentration ◽  
Arrival Rate ◽  
Time Dependent ◽  
Type Integral ◽  
Dependent Parameter ◽  
Infinite Set

AbstractThe time-dependent solutions of an infinite set of differential-difference equations arising from queueing theory and models of ‘living’ polymer are expressed in terms of modified Bessel functions. Explicit solutions are available for constant values of a parameter describing the arrival rate or monomer concentration; for time-dependent parameter a formal solution is obtained in terms of a function which satisfies a Volterra type integral equation of the second kind. These results are used as the basis of a numerical method of solving the infinite set of differential equations when the time-dependent parameter itself satisfies a differential equation.

SEMISTABILITY OF SYZYGY BUNDLES ON PROJECTIVE SPACES IN POSITIVE CHARACTERISTICS

2010 ◽  
Vol 21 (11) ◽  
pp. 1475-1504 ◽  
Author(s):  
V. TRIVEDI
Keyword(s):  
Line Bundle ◽  
Characteristic Zero ◽  
Projective Spaces ◽  
Restriction Theorem ◽  
Strong Restriction ◽  
Infinite Set

We generalize a result of Flenner, proved in characteristic zero, to positive characteristics. We prove that the first syzygy bundle, [Formula: see text], of the line bundle [Formula: see text] over [Formula: see text] is semistable, for a certain infinite set of integers d ≥ 0. Moreover, for arbitrary d, there is a "good enough estimate" on [Formula: see text] in terms of d and n; thus a strong restriction theorem of Langer, proved earlier for characteristic k > d, is valid in arbitrary characteristics.

scholarly journals Nilpotents in semigroups of partial transformations

1997 ◽  
Vol 55 (3) ◽  
pp. 453-467 ◽  
Author(s):  
R. P. Sullivan
Keyword(s):  
Partial Transformation ◽  
Index 2 ◽  
Infinite Set

In 1987, Sullivan determined when a partial transformation α of an infinite set X can be written as a product of nilpotent transformations of the same set: he showed that when this is possible and the cardinal of X is regular then α is a product of 3 or fewer nilpotents with index at most 3. Here, we show that 3 is best possible on both counts, consider the corresponding question when the cardinal of X is singular, and investigate the role of nilpotents with index 2. We also prove that the nilpotent-generated semigroup is idempotent-generated but not conversely.

Shape Grammars and Their Languages: A Methodology for Product Design and Product Representation

1997 ◽  
Author(s):  
Manish Agarwal ◽  
Jonathan Cagan
Keyword(s):  
Product Design ◽  
Shape Grammar ◽  
Shape Grammars ◽  
Product Representation ◽  
Competitive Products ◽  
Infinite Set

Abstract This paper argues that shape grammars and the languages they define are an ideal means to generate and represent products where basic functionality can be decomposed into discrete processes, forms can be created to fulfill those functional processes, and variation in those forms differentiates between competitive products. A shape grammar for the design of coffee makers is highlighted and used to illustrate how an infinite set of a class of products can be articulated through a concise shape grammar. Novel coffee makers and coffee makers in the market today are generated from the grammar.

Sign in / Sign up

Export Citation Format

Share Document