Related papers: 2-balanced sequences coding rectangle exchange tra…
We determine the colored patterns that appear in any $2$-edge coloring of $K_{n,n}$, with $n$ large enough and with sufficient edges in each color. We prove the existence of a positive integer $z_2$ such that any $2$-edge coloring of…
Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…
We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of…
Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound $2n$ on the communication…
We prove that the class of permutations generated by passing an ordered sequence $12\dots n$ through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length…
Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the…
The complexity of bilinear maps (equivalently, of $3$-mode tensors) has been studied extensively, most notably in the context of matrix multiplication. While circuit complexity and tensor rank coincide asymptotically for $3$-mode tensors,…
A rapid transformation is derived between spherical harmonic expansions and their analogues in a bivariate Fourier series. The change of basis is described in two steps: firstly, expansions in normalized associated Legendre functions of all…
We establish closed-form enumeration formulas for chromatic feature vectors of 2-trees under the bichromatic triangle constraint. These efficiently computable structural features derive from constrained graph colorings where each triangle…
A classical (or quantum) second order superintegrable system is an integrable n-dimensional Hamiltonian system with potential that admits 2n-1 functionally independent second order constants of the motion polynomial in the momenta, the…
In previous papers of this series, we presented a formalism able to account for both statistical equilibrium of a multilevel atom and coherent and incoherent scatterings (partial redistribution). aims: This paper provides theoretical…
A class of binary sequences with period $2p$ is constructed using generalized cyclotomic classes, and their linear complexity, minimal polynomial over ${\mathbb{F}_{{q}}}$ as well as 2-adic complexity are determined using Gauss period and…
We develop the algebraic formalism of the formal ternary laws of C. Walter and we compare them to Buchstaber's 2-valued formal group laws. We also compute the "elementary" formal ternary laws (after inverting 2) using a computer program…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
We study a model of communication complexity that encompasses many well-studied problems, including classical and quantum communication complexity, the complexity of simulating distributions arising from bipartite measurements of shared…
We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for bilinear functions, which include computation of matrix…
We offer some partition functions related to ternary quadratic forms, and note on their upper bounds and related properties. We offer these results as an application of a simple method related to conjugate Bailey pairs presented in a prior…
Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…
Using Chiral Perturbation Theory at one-loop we analyze the consequences of twisted boundary conditions. We point out that due to the broken Lorentz and reflection symmetry a number of unexpected terms show up in the expressions. We…
We consider the scalar Helmholtz equation with variable, discontinuous coefficients, modelling transmission of acoustic waves through an anisotropic penetrable obstacle. We first prove a well-posedness result and a frequency-explicit bound…