The paper studies balanced subfamilies of the middle layer of the Boolean lattice and proves a conjecture about the existence of a family with no balanced subfamilies of certain sizes.

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 to decompose the dynamics of Boolean networks into modules using an algebraic framework.

The paper investigates the ability of evolutionary computation to discover monotone Boolean functions with high nonlinearity, demonstrating that genetic programming is a highly effective encoding for…

This paper unconditionally proves the Orthogonal Vectors and Monotone Orthogonal Vectors conjectures in concrete computational models, and provides stronger lower bounds for Boolean formulas and branc…

This paper proves lower bounds on the number of recursive calls made by two algorithms for monotone Boolean duality testing.

This paper shows that finite unions of intersecting affine modules in one dimension are efficiently exactly learnable using equivalence and subset queries.

This paper surveys structured lattices and their applications in lattice-based cryptography and secure wireless communications.

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…

The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

One clear sentence describing what this paper does

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…

This paper presents algorithms to enumerate and find maximal enclosed vector subspaces in a given set of vectors over a finite field, with a quadratic speed-up compared to brute force.

The authors introduce a new hardware architecture for efficient reinforcement learning using asynchronous Boolean networks.