1,836+ open-access research outputs.
We prove that a class of classical lattice models on $\mathbb{Z}^d$ ($d \geq 2$) with on-site space $\mathbb{N}_0$ exhibits long-range checkerboard order at sufficiently high temperature. The model ha…
We present a uniform framework for constructing $3$-designs from $\mathrm{GL}_2(\mathbb F_q)$-invariant subspaces of $\mathbb F_q[X,Y]_k$, the space of homogeneous polynomials of degree $k$. Given suc…
Let $U$ be a Lucas sequence, $p$ be prime, and $\rho_U(p)$ be the rank of appearance of $p$ in $U$. We derive closed-form formulas for the Dirichlet density of primes $p$ for which $d\mid \rho_U(p)$, …
Prompt optimization methods either analyze individual failures in isolation or compare prompt variants across examples, operating on single execution traces with no access to the reasoning process dis…
We study the set $S(q)$ of residue classes $r$ modulo the Pisano period $\pi(q)$ for which $q \mid \varphi(F_m)$ for every $m \equiv r \pmod{\pi(q)}$. We prove that if $q$ is a Sophie Germain prime an…
Graph-based Retrieval-Augmented Generation (GraphRAG) enhances LLMs by structuring corpus into graphs to facilitate multi-hop reasoning. While recent lightweight approaches reduce indexing costs by le…
We introduce C-GenReg, a training-free framework for 3D point cloud registration that leverages the complementary strengths of world-scale generative priors and registration-oriented Vision Foundation…
In this paper, we exhibit $\textsf{AC}^{3}$ isomorphism tests for coprime extensions $H \ltimes N$ where $H$ is elementary Abelian and $N$ is Abelian; and groups where $\text{Rad}(G) = Z(G)$ is elemen…
Alan Turing is considered as a founder of current computer science together with Kurt Godel, Alonzo Church and John von Neumann. In this paper multiple new research results are presented. It is demons…
In this work we develop exact formulas to the number of solutions of $ax+by+cz=n$ in some special cases. In 2020, Binner gave a formula for the number of non negative integer solutions, $N(a,b,c;n)$ i…
The Lucas sequences are integers defined by a homogeneous recurrence relation. They include the well-known Fibonacci numbers, which appear abundantly in nature. The complementary Lucas numbers, define…
We comment on a recent manuscript "Ether of Orbifolds" by Henry Lamm. In the first version, it was mistakenly claimed that the orbifold lattice Hamiltonian is not gauge invariant, and a quantity $\eps…
In large software ecosystems, semantically related code changes, such as alternative solutions or overlapping modifications are often discovered only days after submission, leading to duplicated effor…
A homemorphism between domains in $\mathbb R^n$, $n\ge 2$ is quasiconformal, with its intricate analytic and geometric consequences, if the (pointwise) linear dilatation -- a purely metric quantity --…
Let $X\subseteq\{0,1\}^n$ be a set of binary strings of length $n$. The daisy cube $Q_n(X)$ is the subgraph of the hypercube $Q_n$ induced by the union of the intervals $I(x,0^n)$ for $x\in X$. As a s…
Let $\left(P_{n}\right)_{n\geq0}$ be the sequence of bi-periodic Padovan numbers and let $\left(M_{p_{n}}\right)_{n\geq0}$ be the sequence of bi-periodic Padovan matrices. In this article we study whe…
We prove that if $A$ and $B$ are daisy cubes whose $\tau$-graphs are forests, then $A$ and $B$ are isomorphic if and only if their $\tau$-graphs are isomorphic. The result is applied to show that a da…
Athermal elongated particles are well-known to follow Jeffery orbits when sheared in viscous fluids. It is less clear if similar orbits appear in dense granular flows. We show that when sheared for lo…
Let $k\ge 2$ and $\{L_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$-Lucas numbers whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this pap…
Let $(F_n)_{n\ge0}$ and $(L_n)_{n\ge0}$ denote the sequences of Fibonacci and Lucas numbers respectively. This paper determines all Lucas numbers that can be represented as base $b$ mixed concatenatio…
Free open-access publishing with Google Scholar indexing.
Submission Guide →