Index Catalog // ScholarsArchive@OSU

Khinchin's theorem on the Schnirelmann density of sums of sets of integers

Creator:: Gregersen, Gordon Stanley
Abstract:: In 1932 A. Ya. Khinchin gave the first partial solution of the celebrated 1931 αβ Conjecture of L.G. Schnirelmann and E. Landau of the density of sums of sets on integers, which was completely proved in 1942 by H.B. Mann. Khinchin's theorem is proved along with theorems of P. Scherk...
Resource Type:: Masters Thesis
Full Text:: given. KHINCHIN'S THEOREM ON THE SCHNIRELMANN DENSITY OF SUMS OF SETS OF INTEGERS by GORDON STANLEY

An inequality for the number of integers in the sum of two sets of integers

Creator:: Lim, Yeam Seng
Resource Type:: Masters Thesis
Full Text:: . Mann, H. B. A proof of the fundamental theorem on the density of sums of sets of positive integers

Some conditions for a given positive integer to be contained in a sum of sets of nonnegative integers

Creator:: Pierce, Patricia Carrie
Abstract:: In this thesis, we study conditions not involving density which guarantee that a given positive integer is contained in a sum of sets of nonnegative integers. We survey the literature, give more detailed proofs of some known theorems, develop some new theorems, and make some conjectures.
Resource Type:: Masters Thesis
Full Text:: Contained in a Sum of Sets of Nonegative Integers AN ABSTRACT OF THE THESIS OF PATRICIA CARRIE PIERCE

Computational improvements to Benders decomposition for generalized fixed charge problems

Creator:: Battilega, John Anthony
Abstract:: A computationally efficient algorithm has been developed for determining exact or approximate solutions for large scale generalized fixed charge problems. This algorithm is based on a relaxation of the Benders decomposition procedure, combined with a linear mixed integer programming (MIP) algorithm specifically designed to solve the problem associated with Benders...
Resource Type:: Dissertation
Full Text:: based on a relaxa- tion of the Benders decomposition procedure, combined with a linear mixed integer

Exploring the structural dynamics of human understanding : an historico-philosophical analysis of the problem of meaning in Heidegger and Bohr

Creator:: Tattersall, Mason
Abstract:: This dissertation explores the structural dynamics of human understanding and particularly the concept of meaning and its connections to concepts of ultimate ground, necessity and contingency, language, and perception. It focuses on the history of the concept of meaning in early twentieth-century European physics and philosophy, through an analysis of...
Resource Type:: Dissertation
Full Text:: Crisis of European Culture out of the library and my future trajectory was set. David has taught

Sums of subsets of certain algebraic systems

Creator:: Higdem, Roger Leon
Abstract:: In this thesis we investigate the extension of certain theorems of additive number theory to three algebraic systems. A generalization of a theorem by Cauchy and Davenport on the cardinality of the sum of two sets of residue classes is given. We obtain and compare estimates for the order of...
Resource Type:: Dissertation

Fourier Analysis and Equidistribution on the p-adic Integers

Creator:: Somasunderam, Naveen
Abstract:: In this dissertation, we use Fourier-analytic methods to study questions of equidistribution on the compact abelian group Zp of p-adic integers. In particu- lar, we prove a LeVeque-type Fourier analytic upper bound on the discrepancy of sequences. We establish p-adic analogues of the classical Dirichlet and Fejér kernels on R/Z,...
Resource Type:: Dissertation
Full Text:: ), Zp is called the ring of p-adic integers. By Z×p , we denote the set of all the elements of Zp whose

New theorems and examples for Freedman's density spaces

Creator:: Olson, Arthur Eugene, Jr
Resource Type:: Masters Thesis
Full Text:: number of positive integers in the set A which do not exceed n. Then the Schnirelmann density of A is

Communication efficient private set and database operations

Creator:: Garimella, Gayathri Annapurna
Abstract:: Secure Computation is a powerful tool that enables a set of parties to jointly compute any function over their private inputs, without a trusted third party. Private Set Intersection is a specific case of two-party Secure Computation, where Alice (with private set X) and Bob (with private set Y) specifically...
Resource Type:: Dissertation
Full Text:: Introduction Private set intersection (PSI) allows parties to learn the intersection of sets that they each

A general theory of density in additive number theory

Creator:: Freedman, Allen Roy
Abstract:: See PDF for abstract.
Resource Type:: Dissertation
Full Text:: for the density of the sum of two subsets of an s-set. Copyright by ALLEN ROY FREEDMAN 1965 A

ScholarsArchive@OSU

Khinchin's theorem on the Schnirelmann density of sums of sets of integers

An inequality for the number of integers in the sum of two sets of integers

Some conditions for a given positive integer to be contained in a sum of sets of nonnegative integers

Computational improvements to Benders decomposition for generalized fixed charge problems

Exploring the structural dynamics of human understanding : an historico-philosophical analysis of the problem of meaning in Heidegger and Bohr

Sums of subsets of certain algebraic systems

Fourier Analysis and Equidistribution on the p-adic Integers

New theorems and examples for Freedman's density spaces

Communication efficient private set and database operations

A general theory of density in additive number theory

Limit your search

Academic Affiliation

Advisor

Commencement Year

Committee Member

Creator

Contributor

Date

Decade

Degree Field

Degree Level

Degree Name

File Format

Language

License

Location

Non-Academic Affiliation

Peer Reviewed

Resource Type

Rights Statement

Subject

Search Constraints

Search Results

Limit your search