Displaying similar documents to “On embedding models of arithmetic of cardinality ℵ₁ into reduced powers”

On a certain class of arithmetic functions

Antonio M. Oller-Marcén (2017)

Mathematica Bohemica

Similarity:

A homothetic arithmetic function of ratio K is a function f : R such that f ( K n ) = f ( n ) for every n . Periodic arithmetic funtions are always homothetic, while the converse is not true in general. In this paper we study homothetic and periodic arithmetic functions. In particular we give an upper bound for the number of elements of f ( ) in terms of the period and the ratio of f .

P λ -sets and skeletal mappings

Aleksander Błaszczyk, Anna Brzeska (2013)

Colloquium Mathematicae

Similarity:

We prove that if the topology on the set Seq of all finite sequences of natural numbers is determined by P λ -filters and λ ≤ , then Seq is a P λ -set in its Čech-Stone compactification. This improves some results of Simon and of Juhász and Szymański. As a corollary we obtain a generalization of a result of Burke concerning skeletal maps and we partially answer a question of his.

Guessing clubs in the generalized club filter

Bernhard König, Paul Larson, Yasuo Yoshinobu (2007)

Fundamenta Mathematicae

Similarity:

We present principles for guessing clubs in the generalized club filter on κ λ . These principles are shown to be weaker than classical diamond principles but often serve as sufficient substitutes. One application is a new construction of a λ⁺-Suslin-tree using assumptions different from previous constructions. The other application partly solves open problems regarding the cofinality of reflection points for stationary subsets of [ λ ] .

Numerical characterization of nef arithmetic divisors on arithmetic surfaces

Atsushi Moriwaki (2014)

Annales de la faculté des sciences de Toulouse Mathématiques

Similarity:

In this paper, we give a numerical characterization of nef arithmetic -Cartier divisors of C 0 -type on an arithmetic surface. Namely an arithmetic -Cartier divisor D ¯ of C 0 -type is nef if and only if D ¯ is pseudo-effective and deg ^ ( D ¯ 2 ) = vol ^ ( D ¯ ) .

Counting models of set theory

Ali Enayat (2002)

Fundamenta Mathematicae

Similarity:

Let T denote a completion of ZF. We are interested in the number μ(T) of isomorphism types of countable well-founded models of T. Given any countable order type τ, we are also interested in the number μ(T,τ) of isomorphism types of countable models of T whose ordinals have order type τ. We prove: (1) Suppose ZFC has an uncountable well-founded model and κ ω , , 2 . There is some completion T of ZF such that μ(T) = κ. (2) If α <ω₁ and μ(T,α) > ℵ₀, then μ ( T , α ) = 2 . (3) If α < ω₁ and T ⊢ V ≠ OD,...

On generalized square-full numbers in an arithmetic progression

Angkana Sripayap, Pattira Ruengsinsub, Teerapat Srichan (2022)

Czechoslovak Mathematical Journal

Similarity:

Let a and b . Denote by R a , b the set of all integers n > 1 whose canonical prime representation n = p 1 α 1 p 2 α 2 p r α r has all exponents α i ( 1 i r ) being a multiple of a or belonging to the arithmetic progression a t + b , t 0 : = { 0 } . All integers in R a , b are called generalized square-full integers. Using the exponent pair method, an upper bound for character sums over generalized square-full integers is derived. An application on the distribution of generalized square-full integers in an arithmetic progression is given. ...

Filter factors of truncated TLS regularization with multiple observations

Iveta Hnětynková, Martin Plešinger, Jana Žáková (2017)

Applications of Mathematics

Similarity:

The total least squares (TLS) and truncated TLS (T-TLS) methods are widely known linear data fitting approaches, often used also in the context of very ill-conditioned, rank-deficient, or ill-posed problems. Regularization properties of T-TLS applied to linear approximation problems A x b were analyzed by Fierro, Golub, Hansen, and O’Leary (1997) through the so-called filter factors allowing to represent the solution in terms of a filtered pseudoinverse of A applied to b . This paper focuses...

Relative co-annihilators in lattice equality algebras

Sogol Niazian, Mona Aaly Kologani, Rajab Ali Borzooei (2024)

Mathematica Bohemica

Similarity:

We introduce the notion of relative co-annihilator in lattice equality algebras and investigate some important properties of it. Then, we obtain some interesting relations among -irreducible filters, positive implicative filters, prime filters and relative co-annihilators. Given a lattice equality algebra 𝔼 and 𝔽 a filter of 𝔼 , we define the set of all 𝔽 -involutive filters of 𝔼 and show that by defining some operations on it, it makes a BL-algebra.

Characterizing the powerset by a complete (Scott) sentence

Ioannis Souldatos (2013)

Fundamenta Mathematicae

Similarity:

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing previous work of the author. A cardinal κ is characterized by a Scott sentence ϕ if ϕ has a model of size κ, but no model of size κ⁺. The main question in this paper is the following: Are the characterizable cardinals closed under the powerset operation? We prove that if β is characterized by a Scott sentence, then 2 β + β is (homogeneously) characterized by a Scott sentence, for all 0 <...

A note on the article by F. Luca “On the system of Diophantine equations a ² + b ² = ( m ² + 1 ) r and a x + b y = ( m ² + 1 ) z ” (Acta Arith. 153 (2012), 373-392)

Takafumi Miyazaki (2014)

Acta Arithmetica

Similarity:

Let r,m be positive integers with r > 1, m even, and A,B be integers satisfying A + B ( - 1 ) = ( m + ( - 1 ) ) r . We prove that the Diophantine equation | A | x + | B | y = ( m ² + 1 ) z has no positive integer solutions in (x,y,z) other than (x,y,z) = (2,2,r), whenever r > 10 74 or m > 10 34 . Our result is an explicit refinement of a theorem due to F. Luca.

Finiteness results for Diophantine triples with repdigit values

Attila Bérczes, Florian Luca, István Pink, Volker Ziegler (2016)

Acta Arithmetica

Similarity:

Let g ≥ 2 be an integer and g be the set of repdigits in base g. Let g be the set of Diophantine triples with values in g ; that is, g is the set of all triples (a,b,c) ∈ ℕ³ with c < b < a such that ab + 1, ac + 1 and bc + 1 lie in the set g . We prove effective finiteness results for the set g .

On systems of diophantine equations with a large number of solutions

Jerzy Browkin (2010)

Colloquium Mathematicae

Similarity:

We consider systems of equations of the form x i + x j = x k and x i · x j = x k , which have finitely many integer solutions, proposed by A. Tyszka. For such a system we construct a slightly larger one with much more solutions than the given one.

Diophantine equations involving factorials

Horst Alzer, Florian Luca (2017)

Mathematica Bohemica

Similarity:

We study the Diophantine equations ( k ! ) n - k n = ( n ! ) k - n k and ( k ! ) n + k n = ( n ! ) k + n k , where k and n are positive integers. We show that the first one holds if and only if k = n or ( k , n ) = ( 1 , 2 ) , ( 2 , 1 ) and that the second one holds if and only if k = n .

On some Diophantine equations involving balancing numbers

Euloge Tchammou, Alain Togbé (2021)

Archivum Mathematicum

Similarity:

In this paper, we find all the solutions of the Diophantine equation B 1 p + 2 B 2 p + + k B k p = B n q in positive integer variables ( k , n ) , where B i is the i t h balancing number if the exponents p , q are included in the set { 1 , 2 } .

G -supplemented property in the lattices

Shahabaddin Ebrahimi Atani (2022)

Mathematica Bohemica

Similarity:

Let L be a lattice with the greatest element 1 . Following the concept of generalized small subfilter, we define g -supplemented filters and investigate the basic properties and possible structures of these filters.