arXiv subjects

Bogdan Dumitru

Publications and source records attributed to Bogdan Dumitru.

6 recordsLinked to original sources

arXiv2026

Sunflower-Free Uniform Families: Recursive Constructions and Explicit Bounds

Let $f(w,k)$ be the maximum size of a $w$-uniform family containing no sunflower with $k$ petals. We introduce a recursive construction for sunflower-free families and use it to obtain a general lower bound on the exponential growth rate of $f(w,k)$. We also prove a general upper bound for $3$-uniform families with at least four petals. Our results give $39\le f(3,4)\le49$, $f(3,5)\le146$, $153\le f(3,6)\le255$, $259\le f(3,7)\le474$, and $54\le f(4,3)\le83$. In addition, we prove that the maximum size of an intersecting $4$-uniform family containing no sunflower with three petals is $27$. The upper bounds $49$ and $83$ are computer-assisted. The finite lower bounds come from explicit constructions.

math.CO↗

arXiv2026

Short arithmetic terms express the cardinality of elliptic curves in Weierstraß normal form over finite fields

Arithmetic terms are fixed finite compositions of additions, multiplications, subtractions, divisions with remainder and integer exponentiations. An arithmetic term in natural numbers $A$, $B$, $n$, obtained by refining the general method of the second author (arXiv:2608.22049) for elliptic curves in Weierstraß normal form, counts the solutions in $(\mathbb Z/n\mathbb Z)^2$ for every modulus $n \geq 1$, with intermediate integers of approximately $2n^5$ binary digits instead of approximately $2n^{11}$. For a prime modulus $p \geq 17$, a second construction, based on the Hasse invariant and on the trace of Frobenius, gives a term of about thirty operations, in place of the fifty-one products of generalized geometric progressions of the general method.

math.NT↗

arXiv2026

An Exhaustive Census of Main-Diagonal Symmetric Costas Arrays of Orders 37-42

We determine by exhaustive enumeration all main-diagonal symmetric Costas arrays of orders 37 through 42. There are 4 arrays of order 37, none of order 38, 16 of order 39, 2 of order 40, 12 of order 41, and 4 of order 42. All belong to known finite-field constructions. The arrays at orders 37-40 are Lempel arrays over $\mathbb{F}_{41}$ or their corner deletions and augmentations; the twelve arrays at order 41 are the Lempel arrays over $\mathbb{F}_{43}$; and the order-42 census consists of two corner augmentations and a reverse-complement pair in the Rickard-Golomb family. Combined with the published census through order 36, these results show that no sporadic main-diagonal symmetric Costas array occurs at orders 24-42. We also develop a collision model for random involutions. The first two terms of its collision exponent are derived analytically, $n^2/18+n^{3/2}/360$, with an $O(n)$ remainder. The lower-order model and clumping correction are empirical. The six new censuses are consistent with the model's prediction of a rapidly declining expected sporadic population.

math.CO↗

arXiv2026

Alternating Extremes in Graceful Labelings of Full Binary Trees and Spider Trees

We study a pinned form of graceful labeling. For full binary trees, we ask whether some deepest root-to-leaf path can carry the alternating extreme pattern $0,n-1,1,n-2,\dots$. Such a spine uses the extreme labels and largest differences, forcing all off-spine vertices and edges to use the middle labels and smaller differences, respectively. We prove this pinned-spine conjecture for comb full binary trees, verify it computationally for all rooted non-isomorphic full binary trees through order $23$, and give an example showing that a pinned-spine labeling cannot always be chosen as an $α$-labeling. For spider trees, we prove a packing theorem for self-matched legs: pairwise disjoint legs based at hub label $1$, at least one of which contains label $0$, can be combined into a graceful spider, with unused labels attached as hub leaves. This yields graceful labelings for mixed-length spiders with sufficiently many leaves. We also report computations using a depth-first search ordered by largest unused differences and formulate the six-arm problem as an offset five-arm residual problem.

math.CO↗

arXiv2025

Notes on the 33-point Erdős--Szekeres problem

The determination of $ES(7)$ is the first open case of the planar Erdős--Szekeres problem, where the general conjecture predicts $ES(7)=33$. We present a SAT encoding for the 33-point case based on triple-orientation variables and a 4-set convexity criterion for excluding convex 7-gons, together with convex-layer anchoring constraints. The framework yields UNSAT certificates for a collection of anchored subfamilies. We also report pronounced runtime variability across configurations, including heavy-tailed behavior that currently dominates the computational effort and motivates further encoding refinements.

math.CO↗

arXiv2025

Two-colorings of finite grids: variations on a theorem of Tibor Gallai

A celebrated but non-effective theorem of Tibor Gallai states that for any finite set $A$ of $\Z^n$ and for any finite number of colors $c$ there is a minimal $m$ such that no coloring of the finite $m^n$-grid can avoid that a homothetic image of $A$ is monochromatic. We find (or confirm) $m$ for equilateral triangles, squares, and various types of rectangles. Also, we extend the problem from homothety to general similarity, or to similarity generated using some special rotations. In particular, we compute Gallai similarity numbers for lattice rectangles similar to $1\times k$ (in all orientations) for $k=2,3,4$. The solutions have been found in the framework of the Satisfiability Problem in Propositional Logic (SAT). While some questions were solved using managed brute force, for the more computationally intensive questions we used modern SAT solvers together with symmetry breaking techniques. Some other minor questions are solved for triangles and squares, and new lower bounds are found for regular hexagons on the triangular lattice and for three-dimensional cubes in $\Z^3$.

math.CO↗