Results 21 to 30 of about 1,601 (139)
Advances in Discrete Mathematics: From Combinatorics to Cryptography
Discrete mathematics forms the foundation for various fields, including computer science and cryptography, by providing essential tools for problem-solving in discrete structures. This paper explores the advancements in discrete mathematics, focusing on combinatorics and cryptography.
Romi Bala, Hemant Pandey
openaire +1 more source
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
Variants of a theorem of Macbeath in finite‐dimensional normed spaces
Abstract A classical theorem of Macbeath states that for any integers d⩾2$d \geqslant 2$, n⩾d+1$n \geqslant d+1$, d$d$‐dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with n$n$ vertices.
Zsolt Lángi, Shanshan Wang
wiley +1 more source
Ordinary primes for GL2$\operatorname{GL}_2$‐type abelian varieties and weight 2 modular forms
Abstract Let A$A$ be a g$g$‐dimensional abelian variety defined over a number field F$F$. It is conjectured that the set of ordinary primes of A$A$ over F$F$ has positive density, and this is known to be true when g=1,2$g=1, 2$, or for certain abelian varieties with extra endomorphisms.
Tian Wang, Pengcheng Zhang
wiley +1 more source
Counting problems for orthogonal sets and sublattices in function fields
Abstract Let K=Fq((x−1))$\mathcal {K}=\mathbb {F}_q((x^{-1}))$. Analogous to orthogonality in the Euclidean space Rn$\mathbb {R}^n$, there exists a well‐studied notion of ultrametric orthogonality in Kn$\mathcal {K}^n$. In this paper, we extend the work of [4] on counting problems related to orthogonality in Kn$\mathcal {K}^n$.
Noy Soffer Aranov, Angelot Behajaina
wiley +1 more source
Abstract We establish the connection between the Steinitz problem for ordering vector families in arbitrary norms and its variant for not necessarily zero‐sum families consisting of “nearly unit” vectors.
Gergely Ambrus, Rainie Heck
wiley +1 more source
Combinatorics: The Mathematics of Fair Thieves and Sophisticated Forgetters
Mathematics is the most logical and unbiased scientific field there is. What is true in mathematics today will forever stay true, and mathematical arguments will always clearly indicate which side “wins”. These are some of the characteristics of mathematics that I have liked very much since I was young.
openaire +1 more source
Mathematical Combinatorics (International Book Series)
The Mathematical Combinatorics (International Book Series) is a fully refereed international book series with ISBN number on each issue, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 100-150 pages approx.
openaire +1 more source
Mathematical Combinatorics & Smarandache Multi-Spaces
This book is for young students, words of one mathematician, also being a physicist and an engineer to young students. By recalling each of his growth and success steps, beginning as a construction worker, obtained a certification of undergraduate learn by himself and a doctor’s degree in university, after then continuously overlooking these obtained ...
openaire +1 more source
International Journal of Mathematical Combinatorics, vol. 2 / 2018
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 110-160 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandache multi-spaces, Smarandache ...
openaire +1 more source

