SearcharxivSearch

arXiv subjects

Mahesh Ramani

Publications and source records attributed to Mahesh Ramani.

10 recordsLinked to original sources

Robust Repulsion for Growing Crowns in Linear Hypergraphs

Put $q=r-1$, $t=k-1$, and $D=tq+1$. For an edge $e$ of a linear $C^r_{1,k}$-free $r$-uniform hypergraph, define \[ δ_H(e)=\sum_{v\in e}\frac{1}{d_H(v)}-\frac{r}{D}. \] The defect satisfies $δ_H(e)\ge 0$. At equality, every vertex of $e$ has degree $D$, and the petal trace at $e$ is a disjoint union of $t$ affine planes of order $q$. Equivalently, restoring the base line gives $t$ projective planes of order $q$ with common line $e$. For growing crowns, the equality structure is stable in the following sense. If $q_j\to\infty$, $2\le t_j\le q_j$, and $e_j$ is an edge of a finite linear $C_{1,t_j+1}^{q_j+1}$-free hypergraph satisfying \[ \frac{t_j^2}{q_j}\to0, \qquad t_j^3δ_{H_j}(e_j)\to0, \] then, for every fixed $0<θ<1$, \[ \frac{ |\{f\ne e_j:f\cap e_j\ne\varnothing,\ δ_{H_j}(f)\geθ/t_j^2\}| }{(q_j+1)(t_jq_j)} \to1. \] Thus an edge close to equality is adjacent almost entirely to edges with defect of order at least $t_j^{-2}$. A uniform form gives absolute constants $Q_0,\varepsilon_0,c_0>0$ such that, whenever $q\ge Q_0t^2$ and $δ_H(e)<\varepsilon_0/t^3$, at least $\tfrac12(q+1)tq$ neighbors of $e$ have defect at least $1/(100t^2)$. Consequently, \[ c^{\mathrm{lin}}_{q+1,t+1}\le t-\frac{c_0}{t}, \] where $c^{\mathrm{lin}}_{r,k}$ denotes the asymptotic linear Turán coefficient for $C^r_{1,k}$.

math.CO

Blocking Amalgamations, Maximal Arcs, and Generalized Crowns

Let $C^r_{1,k}$ be the $r$-uniform $k$-crown and put $h=r-k+2$. For a finite linear intersecting $r$-uniform hypergraph $G$, let $τ_h(G)$ be the minimum size of a set meeting every edge of $G$ in at least $h$ vertices, and define \[ ρ_{r,k}=\sup_G\frac{|E(G)|}{τ_h(G)}. \] We prove that every fixed pair $(G,B)$, with $B$ an $h$-fold transversal, yields \[ \operatorname{ex}^{\mathrm{lin}}_r(n,C^r_{1,k}) \ge \frac{|E(G)|}{|B|}n-O_{G,B}(\sqrt n) \] for all sufficiently large $n$. Incidence counting gives $ρ_{r,k}\le r/h$, and equality is characterized after dualization by a pairwise balanced design with a distinguished regular subfamily. For $r=q+1$, where $q$ is a prime power, truncated projective planes give \[ \frac qh\le ρ_{q+1,k}\le\frac{q+1}{h}. \] The upper endpoint is attained whenever a maximal $h$-arc exists; in particular, if $q$ is even and $h\mid q$, then $ρ_{q+1,k}=(q+1)/h$. Padding the truncated-plane construction gives \[ ρ_{r,r}=(1-o(1))\frac r2 \] and, uniformly for each fixed $\varepsilon>0$ and $\varepsilon r\le k\le r$, \[ ρ_{r,k}=(1+o(1))\frac{r}{r-k+2}. \] For nonintersecting templates, the corresponding transfer is governed by a local safe-block condition that replaces the $h$-fold transversal requirement.

math.CO

A Matrix-Degree Obstruction to Rational Generation of Boolean-Lattice Pseudo-Roots

For the neighborhood seed associated with the four-vertex path $P_4$, the diamond operations do not recover all Boolean-lattice pseudo-roots. The corresponding question for unrestricted rational operations in the free skew field is subtler: the seed map has an invertible linearization and therefore a unique formal inverse near every generic scalar point. We prove that this formal inverse is not free rational. A symmetric one-parameter curve of $2 \times 2$ matrix outputs has a formal inverse whose coefficient field contains an element of degree three over $\mathbb{Q}(t)$. An exact elimination in a quadratic Pauli algebra produces the irreducible cubic. Its conjugate inverse branches are unramified, forcing the generic matrix degree of the seed map to be at least three in every size $n \ge 2$. This contradicts the degree-one consequence of any free rational inverse. The same matrix-degree argument, without specializing a hypothetical inverse, extends the obstruction to every graph containing an induced $P_4$.

math.CO

Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank

Let $P_4^r$ denote the $r$-uniform expansion of the graph path with four edges. We prove that every $n$-vertex linear $r$-uniform $P_4^r$-free hypergraph has at most $(r+1)n/r$ edges, resolving a conjecture of Adak and Verma for every $r \geq 2$. Equality holds precisely for vertex-disjoint unions of Steiner systems $S(2,r,r^2)$. The main ingredient is a sharp incidence-rank inequality. If $N(H)$ is the edge-vertex incidence matrix of a linear $r$-uniform hypergraph whose line graph is a cograph, then $(r+1)\operatorname{rank}_{\mathbb{R}} N(H) \geq r|E(H)|$. Equality holds exactly when every edge-containing component is an $S(2,r,r^2)$. The proof follows the union-join decomposition of cographs. At a join node, the row-difference spaces of the co-components are mutually orthogonal, and the possible rank defect is determined by balanced co-components. Perron-Frobenius theory identifies the smallest balanced pieces as parallel classes of $r$ disjoint $r$-sets, while an orthogonality argument bounds their number by $r+1$. The equality case then reconstructs the Steiner system. The linear Turán bound follows from $\operatorname{rank}_{\mathbb{R}} N(H) \leq |V(H)|$.

math.CO

Cographs and Minimum Diamond-Generating Edge Sets in Boolean Lattices

We study a local closure operation on the cover edges of a Boolean lattice: whenever the two lower edges or the two upper edges of a square face are present, all four edges of that square are added. We prove that every set of cover edges generating the full cover graph of $\mathcal{B}_n$ has cardinality at least $n$, and we classify all generators attaining this bound. For a graph $G$ on $[n]$, let $S_G=\{N_G(i)\to N_G(i)\cup\{i\}:i\in[n]\}$. Then $S_G$ diamond-generates the full cover graph if and only if $G$ is a cograph, and every minimum-cardinality generator arises uniquely in this way. Consequently, labeled minimum diamond-generating sets of $\mathcal{B}_n$ are in bijection with labeled cographs on $n$ vertices.

math.CO

On the Structure of 3D Queen Domination

We study the domination number $γ(Q_n^3)$ of the three-dimensional $n \times n \times n$ queen graph. The main result is a stratified theorem computing, for each position type -- corner, edge, face, or interior -- the number of inner-core vertices dominated by a queen, and showing in particular that interior placements dominate strictly more core cells than boundary placements. This yields a symmetry-reduction principle via the octahedral group and complements the standard counting lower bound and layered upper bound, giving $γ(Q_n^3) = Θ(n^2)$. We also certify exact values for $n \leq 6$ via integer linear programming and independent verification.

math.CO

Spectral Theory of the Toroidal 3D Queen Graph

We study the adjacency spectrum of the toroidal three-dimensional queen graph $G_n$ on $(\mathbb{Z}_n)^3$. Since $G_n$ is a Cayley graph on an abelian group, its adjacency matrix is diagonalized by Fourier characters. For each frequency $a\in(\mathbb{Z}_n)^3$, the corresponding eigenvalue is $λ(a)=nμ(a)-13$, where $μ(a)$ counts the queen directions orthogonal to $a$ modulo $n$. In the generic odd case, meaning $n$ odd with $3\nmid n$, the possible values of $μ(a)$ are exactly $0,1,2,3,4,$ and $13$, and each multiplicity is given by an explicit polynomial in $n$. The proof combines a geometric classification of frequency points by orthogonality type with two global counting identities.

math.CO

An Optimal 14-Symbol Hybrid Basis for BCH-Algebras

We present an optimally minimal two-axiom basis for BCH-algebras. The standard presentation of a BCH-algebra relies on three axioms: two equations and one quasi-identity. Using automated theorem proving, we prove that the two standard equations can be entirely replaced by a 14-symbol equation, ((xy)z)((x(z0))y) = 0, while retaining the standard quasi-identity. We then provide a rigorous proof of strict minimality for this new equational companion. By employing an exhaustive, machine-assisted search space generation coupled with finite countermodel building, we demonstrate that no equation of 12 or fewer symbols can define the class of BCH-algebras when paired with the standard quasi-identity. Our literature searches have revealed no prior proof of this result, to the extent of our knowledge. All equivalence derivations were verified using Prover9, and all minimality countermodels were generated using Mace4.

math.LO

A Comprehensive Corpus of Biomechanically Constrained Piano Chords: Generation, Analysis, and Implications for Voicing and Psychoacoustics

I present the generation and analysis of the largest known open-source corpus of playable piano chords (approximately 19.3 million entries). This dataset enumerates the two-handed search space subject to biomechanical constraints (two hands, each with 1.5 octave reach) to an unprecedented extent. To demonstrate the corpus's utility, the relationship between voicing shape and psychoacoustic targets was modeled. Harmonicity proved intrinsic to pitch-class identity: voicing statistics added negligible variance ($ΔR^2 \approx 0.014\%$, $p \approx 0.13$). Conversely, voicing significantly predicted dissonance ($ΔR^2 \approx 6.75\%$, $p \approx 0.0008$). Crucially, skewness ($β\approx +0.145$) was approximately 5.8$\times$ more effective than spread ($β\approx -0.025$) at predicting roughness. The analysis challenges the pedagogical emphasis on ``spread'': skewness is a stronger predictor of dissonance than spread. This suggests that clarity in ``open voicings'' is driven less by width than by negative skewness; achieving lower-register clearance by placing wide gaps at the bottom and allowing tighter clustering in the treble. The results demonstrate the corpus's ability to enable future research, especially in areas such as generative modeling, voice-leading topology, and psychoacoustic analysis.

cs.SD

Exact Computation of the Catalan Number $C(2,050,572,903)$

This paper presents a two-phase algorithm for computing exact Catalan numbers at an unprecedented scale. The method is demonstrated by computing $C(n)$ for $n = 2,050,572,903$ yielding a result with a targeted $1,234,567,890$ decimal digits. To circumvent the memory limitations associated with evaluating large factorials, the algorithm operates exclusively in the prime-exponent domain. Phase 1 employs a parallel segmented sieve to enumerate primes up to $2n$ and applies Legendre's formula to determine the precise prime factorization of $C(n)$. The primes are grouped by exponent and serialized to disk. Phase 2 reconstructs the final integer using a memory-efficient balanced product tree with chunking. The algorithm runs on a time complexity of $Θ(n(\log n)^2)$ bit-operations and a space complexity of $Θ(n \log n)$ bits. This result represents the largest exact Catalan number computed to date. Performance statistics for a single-machine execution are reported, and verification strategies -- including modular checks and SHA-256 hash validation -- are discussed. The source code and factorization data are provided to ensure reproducibility.

cs.DS