Related papers: On Configurations of Order 2
For any positive integer $q$, the sequence of the Euler up/down numbers reduced modulo $q$ was proved to be ultimately periodic by Knuth and Buckholtz. Based on computer simulations, we state for each value of $q$ precise conjectures for…
Let $A$ be a (not necessarily unital) separable non-elementary simple amenable C*-algebra whose tracial basis may not have finite covering dimension and may not be compact but satisfies certain condition (C). We show that $A$ is ${\cal…
Let $N, p \geq 5$ be primes such that $N \equiv 1 \bmod p$. We study the rank $r$ of the Hecke algebra that parametrizes modular forms of weight 2 and level $N$ that are Eisenstein modulo $p$. When $r$ is $2$ or $3$, we prove that $r-1$…
The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…
Even when starting with a very poor initial guess, the iterative configuration interaction (iCI) approach can converge from above to full CI very quickly by constructing and diagonalizing a small Hamiltonian matrix at each…
Second-order necessary optimality conditions for nonlinear conic programming problems that depend on a single Lagrange multiplier are usually built under nondegeneracy and strict complementarity. In this paper we establish a condition of…
The contributions in this note begin with a new characterization of (positive) scalar multiples of minimal tripotents in a general JB$^*$-triple $E$, proving that a non-zero element $a\in E$ is a positive scalar multiple of a minimal…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
The C-minor partial orders determined by the clones generated by a semilattice operation (and possibly the constant operations corresponding to its identity or zero elements) are shown to satisfy the descending chain condition.
We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…
It is proved that if any Z-graded weak module for vertex operator algebra V is completely reducible, then V is rational and C_2-cofinite. That is, V is regular. This gives a natural characterization of regular vertex operator algebras.
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…
Mathematicians have been interested in non-periodic tilings of space for decades; however, it was the unexpected discovery of non-periodically ordered structures in intermetallic alloys which brought this subject into the limelight. These…
The purpose of this article is to study the algorithmic complexity of the Besicovitch stability of noisy subshifts of finite type, a notion studied in a previous article. First, we exhibit an unstable aperiodic tiling, and then see how it…
In this paper, we investigate some properties of annihilator $(b,c)$-inverses in an arbitrary ring. We demonstrate that one-sided annihilator $(b,c)$-inverses of elements in arbitrary rings may behave differently in contrast to one-sided…
We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…
We consider an $\varepsilon$-periodic ($\varepsilon\to 0$) tubular structure, modelled as a magnetic Laplacian on a metric graph, which is periodic along a single axis. We show that the corresponding Hamiltonian admits norm-resolvent…
For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…
We systematically extend the statement that the configurational entropy provides an alternative approach to studying gravitational stability of compact objects, carried out in the previous work of M. Gleiser and N. Jiang, Phys. Rev. D {\bf…
Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings defined in this way can be studied with a dynamical point of view,…