This paper presents an algorithm to generate snake-like polyominoes within a given rectangle and provides exact formulas for the maximal area of such polyominoes for certain dimensions.

This paper proves an inverse-polynomial spectral-gap bound for the lazy swap chain on binary matrices with prescribed row and column sums, which is a standard sampler for fixed-margin null models.

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

This paper investigates the closeness of singularity for $n imes n$ unimodular matrices, specifically for $(2k+1)$-ary and $(k+1)$-ary cases of $4 imes 4$ nonnegative unimodular matrices.

The paper systematically investigates the conditions under which linear layers in AES-like ciphers avoid related-differential structures, proving that the MDS property is necessary and identifying spe…

The paper analyzes the algorithmic complexity of finding collisions in single-layer binary neural networks, establishing that the collision resistance depends critically on the activation function's t…

This paper presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

This paper proposes methods to optimally permute the rows and columns of a sparse matrix to minimize the number of cyclic diagonals required for homomorphic sparse-matrix vector multiplication, signif…

The paper systematically explores a vast design space of cryptographic Boolean networks by formalizing six structural constraints, finding that optimal designs result from sparse, mutually compatible…

This paper presents a method for identifying probabilistic structures from empirical probability tensors using algebraic statistics and Kronecker-stack class of configuration matrices.

This paper investigates the convergence and stability of equilibria in bimatrix two-player games using the optimistic exponential weights method, allowing step sizes to differ.

The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

This paper proves that the number of distinct rooted binary phylogenetic trees displayed by a binary tree-child network with n leaves is at most 2^(n-1)-1, and shows that this upper bound is sharp.

The paper explains a method for finding the number of solutions to a system of multivariate polynomial inequalities over a finite field and applies it to find formulas for the number of contiguous sup…