Results 101 to 110 of about 654,082 (251)
Abstract In the “Covering” pursuit game on a graph, a robber and a set of cops play alternately, with the cops each moving to an adjacent vertex (or not moving) and the robber moving to a vertex at distance at most 2 from his current vertex. The aim of the cops is to ensure that, after every one of their turns, there is a cop at the same vertex as the ...
Benjamin Gillott
wiley +1 more source
Combinatorics on number walls and the P(t)$P(t)$‐adic Littlewood conjecture
Abstract In 2004, de Mathan and Teulié stated the p$p$‐adic Littlewood conjecture (p$p$‐LC) in analogy with the classical Littlewood conjecture. Let Fq$\mathbb {F}_q$ be a finite field P(t)$P(t)$ be an irreducible polynomial with coefficients in Fq$\mathbb {F}_q$. This paper deals with the analogue of p$p$‐LC over the ring of formal Laurent series over
Steven Robertson
wiley +1 more source
The modular automorphisms of quotient modular curves
Abstract We obtain the modular automorphism group of any quotient modular curve of level N$N$, with 4,9∤N$4,9\nmid N$. In particular, we obtain some unexpected automorphisms of order 3 that appear for the quotient modular curves when the Atkin–Lehner involution w25$w_{25}$ belongs to the quotient modular group. We also prove that such automorphisms are
Francesc Bars, Tarun Dalal
wiley +1 more source
Semidefinite programming, harmonic analysis and coding theory
These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics.
Bachoc, Christine
core +6 more sources
New upper bound for lattice covering by spheres
Abstract We show that there exists a lattice covering of Rn$\mathbb {R}^n$ by Euclidean spheres of equal radius with density O(nlnβn)$O\big (n \ln ^{\beta } n \big)$ as n→∞$n\rightarrow \infty$, where β≔12log28πe33=1.85837….$$\begin{align*} \beta \coloneqq \frac{1}{2} \log _2 {\left(\frac{8 \pi \mathrm{e}}{3\sqrt 3}\right)}=1.85837\,\ldots . \end{align*
Jun Gao +3 more
wiley +1 more source
Further results on permanents of Laplacian matrices of trees
The research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees.
Wu Tingzeng, Dong Xiangshuai
doaj +1 more source
The objective of this research is to describe the improvement of the competence of Olympic workshop participants in problem-solving of mathematics Olympiad for mathematics teachers of Junior High Schools in the Madiun Regency by using the qualitative ...
Mohammad Tohir
doaj +1 more source
Ore's theorem on subfactor planar algebras
This article proves that an irreducible subfactor planar algebra with a distributive biprojection lattice admits a minimal 2-box projection generating the identity biprojection.
Palcoux, Sebastien
core
One‐level densities in families of Grössencharakters associated to CM elliptic curves
Abstract We study the low‐lying zeros of a family of L$L$‐functions attached to the complex multiplication elliptic curve Ed:y2=x3−dx$E_d \;:\; y^2 = x^3 - dx$, for each odd and square‐free integer d$d$. Specifically, upon writing the L$L$‐function of Ed$E_d$ as L(s−12,ξd)$L(s-\frac{1}{2}, \xi _d)$ for the appropriate Grössencharakter ξd$\xi _d$ of ...
Chantal David, Lucile Devin, Ezra Waxman
wiley +1 more source
Δ–Springer varieties and Hall–Littlewood polynomials
The $\Delta $ -Springer varieties are a generalization of Springer fibers introduced by Levinson, Woo and the author that have connections to the Delta Conjecture from algebraic combinatorics.
Sean T. Griffin
doaj +1 more source

