Results 71 to 80 of about 580,253 (234)

Solution of an odds inversion problem [PDF]

Notes on Number Theory and Discrete Mathematics
Consider the problem of determining the possible numbers of balls of two different colors in an urn such that if two are drawn out at random, the odds that they are different colors are a given value. We present a general solution of this problem for all
Robert K. Moniot
doaj   +1 more source

Generalized free wreath products and their operator algebras

Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.
Abstract We develop a new approach on free wreath products, generalizing the constructions of Bichon and of Fima‐Pittau. We show stability properties for certain approximation properties such as exactness, Haagerup property, hyperlinearity, and K‐amenability. We study qualitative properties of the associated von Neumann algebra: factoriality, primeness,
Pierre Fima, Arthur Troupel
wiley   +1 more source

Multivariate discrete splines and linear Diophantine equations [PDF]

Transactions of the American Mathematical Society, 1993
In this paper we investigate the algebraic properties of multivariate discrete splines. It turns out that multivariate discrete splines are closely related to linear diophantine equations. In particular, we use a solvability condition for a system of linear diophantine equations to obtain a necessary and sufficient condition for the integer translates ...
openaire   +1 more source

Moderate Deviation Principles for Lacunary Trigonometric Sums

Mathematische Nachrichten, Volume 299, Issue 5, Page 1028-1044, May 2026.
ABSTRACT Classical works of Kac, Salem, and Zygmund, and Erdős and Gál have shown that lacunary trigonometric sums despite their dependency structure behave in various ways like sums of independent and identically distributed random variables. For instance, they satisfy a central limit theorem (CLT) and a law of the iterated logarithm.
Joscha Prochno, Marta Strzelecka
wiley   +1 more source

On Terms of Generalized Fibonacci Sequences which are Powers of their Indexes

Mathematics, 2019
The k-generalized Fibonacci sequence ( F n ( k ) ) n (sometimes also called k-bonacci or k-step Fibonacci sequence), with k ≥ 2 , is defined by the values 0 , 0 , … , 0 , 1 of starting k its terms and such way ...
Pavel Trojovský
doaj   +1 more source

On the exceptional set in Littlewood's discrete conjecture

Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.
Abstract We consider a discrete analogue of the well‐known Littlewood conjecture on Diophantine approximations and obtain a strong upper bound for the number of exceptional vectors in this conjecture.
I. D. Shkredov
wiley   +1 more source

Systems of linear diophantine equations [PDF]

, 1995
This thesis provides an algorithm for finding the general solutions of a given system of linear Diophantine equations. A linear Diophantine equation is a polynomial equation (in any number of unknowns) with degree one and whose solutions in integers are ...
Alvarade, Ulysses R., Tizon, Edwin E.
core  

Anderson localized states for the quasi-periodic nonlinear Schrödinger equation on Zd $\mathbb Z^d$ double struck upper Z Superscript d

Forum of Mathematics, Sigma
We establish large sets of Anderson localized states for the quasi-periodic nonlinear Schrödinger equation on Zd $\mathbb Z^d$ double struck upper Z Superscript d , thus extending Anderson localization from the linear (cf. Bourgain [Geom.
Yunfeng Shi, Wei-Min Wang
doaj   +1 more source

Design of a New Secured Hierarchical Peer-to-Peer Fog Architecture Based on Linear Diophantine Equation

EPiC series in computing
In recent years, there has been massive growth in the usage of IoT devices. Cloud computing architecture is unable to meet the requirements of bandwidth, real-time response, and latency.
Saydul Akbar Murad, Nick Rahimi, Indranil Roy, B. Gupta   +3 more
semanticscholar   +1 more source

Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations [PDF]

Formal Methods in System Design, 2008
Abstract: "The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interpolants in rational and real linear arithmetic. We focus on subsets of integer linear arithmetic.
Himanshu Jain, Edmund M. Clarke, Orna Grumberg   +2 more
openaire   +3 more sources