Results 21 to 30 of about 233 (111)
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Bounded exponential sums with multiplicative coefficients
Mathematika, Volume 72, Issue 4, October 2026.Abstract We investigate when the exponential sum Sf(x,α):=∑n⩽xf(n)e(nα)$S_f(x,\alpha) := \sum _{n\leqslant x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function f$f$ and α∈R$\alpha \in \mathbb {R}$. We show that under natural assumptions, Sf(x,α)$S_f(x,\alpha)$ is bounded only when f$f$ is very close to a twisted Dirichlet character χ(n ...
Péa Bazin, Ihor Pylaiev, Fred Tyrrell
wiley +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
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
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
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Creativity and Innovation Management, Volume 35, Issue 3, Page 555-569, September 2026.ABSTRACT This paper explores the limits of mission‐directed entrepreneurial states by drawing on the theory of recombinant innovation and F.A. Hayek's insights on the spontaneous growth of knowledge in society. First, the use of discretionary policymaking curtails the range of knowledge generated in the process of social interaction, limiting the scope
Bryan Cheang, Praharsh Mehrotra
wiley +1 more source
The power of many: when genetics met yeasts and high‐throughput
Biological Reviews, Volume 101, Issue 4, Page 1662-1682, August 2026.ABSTRACT In recent years, complex technological capabilities have evolved, driven by the need to solve complex and integrative biological questions through global analyses. New equipment allows the scaling up and automation of processes which previously were carried out on a very limited scale.
Víctor A. Tallada, Víctor Carranco
wiley +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 388-409, August 2026.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley +1 more source
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source