相关论文: A Pascal-like Bound for the Number of Necklaces wi…
We perform the first numerical simulations of necklaces in a non-Abelian gauge theory. Necklaces are composite classical solutions which can be interpreted as monopoles trapped on strings, rather generic structures in a Grand Unified…
An infinite system of nonlocal, individually confining solitons is considered as a model of high-density nuclear matter. The soliton-lattice problem is discussed in the Wigner-Seitz approximation. The cell size is varied to study the…
We introduce Nevanlinna--Pick norms associated with finite families of characters in a commutative semisimple Banach algebra and study the class $NP_\infty$, where all such norms are minimal. Our main result is a topological rigidity…
This paper is devoted to the random generation of particular colored necklaces for which the number of beads of a given color is constrained (these necklaces are called v-balanced). We propose an efficient sampler (its expected time…
Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
This is a report on the present state of the problem of determining the dimension of the Nichols algebra associated to a rack and a cocycle. This is relevant for the classification of finite-dimensional complex pointed Hopf algebras whose…
We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including…
We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1,…
We give a new proof of the Minkowski-Hlawka bound on the existence of dense lattices. The proof is based on an elementary method for constructing dense lattices which is almost effective.
In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…
The paper is motivated by an analogy between cluster algebras and Kac-Moody algebras: both theories share the same classification of finite type objects by familiar Cartan-Killing types. However the underlying combinatorics beyond the two…
A set of valuable universal similarity factorization equalities is established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
We present new solitarywave solutions of the two-dimensional nonlinear Schrodinger equation on bounded domains (such as rectangles, circles, and annuli). These multipeak necklace solitary waves consist of several identical positive profiles…
We define generalized de Bruijn words as those words having a Burrows-Wheeler transform that is a concatenation of permutations of the alphabet. We show that generalized de Bruijn words are in 1-to-1 correspondence with Hamiltonian cycles…
We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of…
Mordechay B. Levin has constructed a number $\lambda$ which is normal in base 2, and such that the sequence $(\left\{2^n \lambda\right\})_{n=0,1,2,\ldots}$ has very small discrepancy $D_N$. Indeed we have $N\cdot D_N = \mathcal{O}…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
We define a quantity $c_m(n,k)$ as a generalization of the notion of the composition of the positive integer $n$ into $k$ parts. We proceed to derive some known properties of this quantity. In particular, we relate two partial Bell…