نتایج جستجو برای: enumeration technique
تعداد نتایج: 622577 فیلتر نتایج به سال:
The jump operator on the ω-enumeration degrees is introduced in [11]. In the present paper we prove a jump inversion theorem which allows us to show that the enumeration degrees are first order definable in the structureDω ′ of the ω-enumeration degrees augmented by the jump operator. Further on we show that the groups of the automorphisms of Dω ′ and of the enumeration degrees are isomorphic. ...
In this paper, a fast and complete method to constructively enumerate fusenes and benzenoids is given. It is fast enough to construct several million non isomorphic structures per second. The central idea is to represent fusenes as labelled inner duals and generate them in a two step approach using the canonical construction path method and the homomorphism principle.
We develop a geometric approach to the study of (s,ms−1)-core and (s,ms+1)core partitions through the associated ms-abaci. This perspective yields new proofs for results of H. Xiong and A. Straub (originally proposed by T. Amdeberhan) on the enumeration of (s, s + 1) and (s,ms− 1)-core partitions with distinct parts. It also enumerates the (s,ms+1)-cores with distinct parts. Furthermore, we cal...
We use the technique of interactive theorem proving to develop the theory and an enumeration technique for finite idempotent relations. Starting from a short mathematical characterization of finite idempotents defined and proved in Isabelle/HOL, we derive first an iterative procedure to generate all instances of idempotents over a finite set. From there, we develop a more precise theoretical ch...
Let χ be a primitive Dirichlet character to the modulus q. Let Sχ(M,N) = ∑ M<n≤N χ(n). The Pólya-Vinogradov inequality states that |Sχ(M,N)| √ q log q. The smoothed Pólya–Vinogradov inequality, recently introduced by Levin, Pomerance and Soundararajan, is a numerically useful version of the Pólya–Vinogradov inequality that saves a log q factor. The smoothed Pólya–Vinogradov inequality has been ...
Let g = g0 ⊕ g1 be a simple Z2-graded Lie algebra and let b0 be a fixed Borel subalgebra of g0. We describe and enumerate the abelian b0-stable subalgebras of g1. §
Coset enumeration, based on the methods described by Todd & Coxeter, is one of the basic tools for investigating nitely presented groups. The process is not well understood, and various pathological presentations of, for example, the trivial group have been suggested as challenge problems. Here we consider one such presentation. We show that it is much easier than it rst appears, albeit at the ...
We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.
Recently, Green and Losonczy [5, 6] introduced freely braided permutations as a special class of restricted permutations that has arisen in the study of Schubert varieties. They suggest as an open problem to enumerate the number of freely braided permutations in Sn. In this paper, we prove that the generating function for the number of freely braided permutations in Sn is given by 1−3x−2x2 +(1+...
We show that if A and B form a nontrivial K-pair, then there is a semi-computable set C such that A ≤e C and B ≤e C. As a consequence, we obtain a definition of the total enumeration degrees: a nonzero enumeration degree is total if and only if it is the join of a nontrivial maximal K-pair. This answers a long-standing question of Hartley Rogers, Jr. We also obtain a definition of the “c.e. in”...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید