Results 41 to 50 of about 165,985,528 (155)
Geometries on partially ordered sets [PDF]
, 1980 Geometries on finite partially ordered sets extend the concept of matroids on finite sets to partially ordered sets. Geometries are defined in terms of closure operators on partially ordered sets.
Faigle, Ulrich
core +1 more source
Abelian number fields with frobenian conditions
Mathematika, Volume 72, Issue 4, October 2026.Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol.3 [PDF]
, 2009 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 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Zeros of polynomials in derivatives of automorphic L$L$‐functions
Mathematika, Volume 72, Issue 4, October 2026.Abstract Let Fm$\mathfrak {F}_m$ be the set of all cuspidal automorphic representations of GLm(AQ)$\mathrm{GL}_m(\mathbb {A}_{\mathbb {Q}})$, and let F(s,π)$F(s,\bm {\pi })$ be a polynomial in the derivatives of L$L$‐functions associated with representations π∈⋃m=1∞Fm$\pi \in \bigcup _{m=1}^{\infty } \mathfrak {F}_m$. We establish an asymptotic formula
Anji Dong +2 more
wiley +1 more source
Bounded diameter monochromatic component covers
Mathematika, Volume 72, Issue 4, October 2026.Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley +1 more source
An effective Bombieri–Vinogradov error term for sifting problems
Mathematika, Volume 72, Issue 4, October 2026.Abstract In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for which they hold cannot be computed.
Daniel R. Johnston
wiley +1 more source
Twelve Challenges for Scaling Teamwork Processes
AI Magazine, Volume 47, Issue 3, Fall 2026.Abstract As we survey and celebrate the unprecedented growth and deployment of AI and robotics, we are concerned that current efforts are overly focused on merely increasing the numbers of fielded systems and the proportion of individuals who use them.
Matthew Johnson, Jeffrey M. Bradshaw
wiley +1 more source
Machine Learning for Synthetic Organic Chemistry: Methods, Applications, and Best Practices
Angewandte Chemie Novit, Volume 2, Issue 3, September 2026.Artificial intelligence (AI) and machine learning (ML) are increasingly reshaping experimental chemistry. This review maps the challenges of synthetic organic chemistry to modern digital tools that can help address them. While focusing on the practical application of ML tools in real‐world laboratory settings, we outline prerequisites, emerging ...
Niklas Hölter +3 more
wiley +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, Volume 34, Issue 9, Page 437-456, September 2026.ABSTRACT A weak c‐colouring of a design is an assignment of colours to its points from a set of c available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol.1 [PDF]
, 2007 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 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source