Composite Integer Research Articles

Brauer Configuration Algebras Induced by Integer Partitions and Their Applications in the Theory of Branched Coverings

Brauer configuration algebras are path algebras induced by appropriated multiset systems. Since their structures underlie combinatorial data, the general description of some of their algebraic invariants (e.g., their dimensions or the dimensions of their centers) is a hard problem. Integer partitions and compositions of a given integer number are examples of multiset systems which can be used to define Brauer configuration algebras. This paper gives formulas for the dimensions of Brauer configuration algebras (and their centers) induced by some integer partitions. As an application of these results, we give examples of Brauer configurations, which can be realized as branch data of suitable branched coverings over different surfaces.

Bijections between Variants of Dyck Paths and Integer Compositions

Bijections between Variants of Dyck Paths and Integer Compositions

A general formula in composition theory

Abstract We prove general formulae in composition theory. We study the number of restricted compositions of a positive integer n in k parts, where the parts are in very general integer sequences. Note that in compositions the order of the parts is considered.

Casting light on integer compositions

Casting light on integer compositions

An Exploration of Degeneracy in Abelian Varieties of Fermat Type

The term degenerate is used to describe abelian varieties whose Hodge rings contain exceptional cycles – Hodge cycles that are not generated by divisor classes. We can see the effect of the exceptional cycles on the structure of an abelian variety through its Mumford-Tate group, Hodge group, and Sato-Tate group. In this article we examine degeneracy through these different but related lenses. We specialize to a family of abelian varieties of Fermat type, namely Jacobians of hyperelliptic curves of the form y 2 = x m − 1 . We prove that the Jacobian of the curve is degenerate whenever m is an odd, composite integer. We explore the various forms of degeneracy for several examples, each illustrating different phenomena that can occur.

Central Limit Theorems via Analytic Combinatorics in Several Variables

The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate generating functions, over the last two decades a theory of analytic combinatorics in several variables (ACSV) has been developed to study the asymptotic behaviour of multivariate sequences. In this work we survey ACSV from a probabilistic perspective, illustrating how its most advanced methods provide efficient algorithms to derive limit theorems, and comparing the results to past work deriving limit theorems. Using the results of ACSV, we provide a SageMath package that can automatically compute (and rigorously verify) limit theorems for a large class of combinatorial generating functions. To illustrate the techniques involved, we also establish an explicit local central limit theorems for a family of combinatorial classes whose generating functions are linear in the variables tracking each parameter. Applications covered by this result include the distribution of cycles in certain restricted permutations (proving a limit theorem stated as a conjecture in recent work of Chung et al.), integer compositions, and n-colour compositions with varying restrictions and values tracked. Key to establishing these explicit results in an arbitrary dimension is an interesting symbolic determinant, which we compute by conjecturing and then proving an appropriate LU-factorization. It is our hope that this work provides readers a blueprint to apply the powerful tools of ACSV in their own work, making them more accessible to combinatorialists, probabilists, and those in adjacent fields.

A Note on the Composition of a Positive Integer whose Parts are Odd Integers

In this study, we interested in the compostions of integers. Then, the combinations of an integer whose each part is odd were examined. 
 \begin{equation*}
 O_{n}=\{(2a_{1}+1,...,2a_{t}+1):\text{ }2a_{1}+1+...+2a_{t}+1=n\text{ and \ }
 a_{i}\text{ positive integer}\}.
 \end{equation*}
 and we call the set as an odd combination set $O_{n}$ set of an integer $n$. Then, an action on the set are defined. Then, the decomposition of the composition sets of a positive integer has been examined by using set theory. Then, we also focused on the combination of an integer n whose sum is less than a fixed integer m. We have obtained the composition set of an integer whose largest part is less than m. Using these sets, we obtained recurrence relations.

Security of elliptic curve cryptosystems over Z_n

Elliptic curves over Galois fields are widely used in modern cryptography. Cryptosystems based on elliptic curves are commonly deemed more secure than RSA for a given key size. However, with the rapid progress of quantum computing, the security of this traditional systems faces unprecedented challenge. To address this concern, this paper explores the resilience of a generalization of traditional elliptic curve cryptography. That is, we explore elliptic curves over non-prime rings (Zn), instead of fields. Elliptic curves over Zn for a composite integer n has been considered by researchers on information security. However, it is unclear how they stand against the unparalleled power of quantum computers. This article investigates quantum attacks on cryptosystems based on this new paradigm. The conclusion sheds light on the pressing and important task of searching for post-quantum cryptographic systems. In particular, the effectiveness of Shors algorithm (or its variation) on such systems is analyzed.

RSA cryptanalysis — Fermat factorization exact bound and the role of integer sequences in factorization problem

Large composite integer factorization algorithms still need to be more efficient and, thus, not operate linearly. The RSA popular cryptographic algorithm strength solely depends on factoring the modulus N. This study proposes a technique based on the Fermat factorization theorem to factor modulus N and decreases processing time, obtaining greater algorithmic and storage complexities. We analyse the Fermat factorization theorem and show why it can factorize numbers in constant time complexity (i.e. O(1)) if the difference is slight. We also derive the exact factorization bound for the Fermat factorization method. Furthermore, we link the Fermat factorization with integer sequences and raise further research questions on how our technique can be generalized to factoring N regardless of the difference between the two prime numbers p and q by linking the Fermat factorization theorem with integer sequences. In the end, We address each thought and raise further research questions showing that identifying formulas for some integer sequences can be the key to factoring any composite integer in a linear time.

Compositions of positive integers with 2sand 3s

AbstractIn this article, we consider compositions of positive integers with 2sand 3s. We see that these compositions lead us to results that involve Padovan numbers, and we give some tiling models of these compositions. Moreover, we examine some tiling models of the compositions related to the Padovan polynomials and prove some identities using the tiling model’s method. Next, we obtain various identities of the compositions of positive integers with 2sand 3srelated to the Padovan numbers. The number of palindromic compositions of this type is determined, and some numerical arithmetic functions are defined. Finally, we provide a table that compares all of the results obtained from compositions of positive integers with 2sand 3s.

Fertilitopes

We introduce tools from discrete convexity theory and polyhedral geometry into the theory of West’s stack-sorting map s. Associated to each permutation pi is a particular set mathcal V(pi ) of integer compositions that appears in a formula for the fertility of pi , which is defined to be |s^{-1}(pi )|. These compositions also feature prominently in more general formulas involving families of colored binary plane trees called troupes and in a formula that converts from free to classical cumulants in noncommutative probability theory. We show that mathcal V(pi ) is a transversal discrete polymatroid when it is nonempty. We define the fertilitope of pi to be the convex hull of mathcal V(pi ), and we prove a surprisingly simple characterization of fertilitopes as nestohedra arising from full binary plane trees. Using known facts about nestohedra, we provide a procedure for describing the structure of the fertilitope of pi directly from pi using Bousquet-Mélou’s notion of the canonical tree of pi . As a byproduct, we obtain a new combinatorial cumulant conversion formula in terms of generalizations of canonical trees that we call quasicanonical trees. We also apply our results on fertilitopes to study combinatorial properties of the stack-sorting map. In particular, we show that the set of fertility numbers has density 1, and we determine all infertility numbers of size at most 126. Finally, we reformulate the conjecture that sum _{sigma in s^{-1}(pi )}x^{textrm{des}(sigma )+1} is always real-rooted in terms of nestohedra, and we propose natural ways in which this new version of the conjecture could be extended.

Seaweeds Arising from Brauer Configuration Algebras

Seaweeds or seaweed Lie algebras are subalgebras of the full-matrix algebra Mat(n) introduced by Dergachev and Kirillov to give an example of algebras for which it is possible to compute the Dixmier index via combinatorial methods. It is worth noting that finding such an index for general Lie algebras is a cumbersome problem. On the other hand, Brauer configuration algebras are multiserial and symmetric algebras whose representation theory can be described using combinatorial data. It is worth pointing out that the set of integer partitions and compositions of a fixed positive integer give rise to Brauer configuration algebras. However, giving a closed formula for the dimension of these kinds of algebras or their centers for all positive integer is also a tricky problem. This paper gives formulas for the dimension of Brauer configuration algebras (and their centers) induced by some restricted compositions. It is also proven that some of these algebras allow defining seaweeds of Dixmier index one.

Prime factorization via localized tile assembly in a DNA origami framework

Modern cybersecurity built on public-key cryptosystems like Rivest-Shamir-Adleman is compromised upon finding solutions to the prime factorization. Nevertheless, solving the prime factorization problem, given a large N, remains computationally challenging. Here, we design DNA origami frameworks (DOFs) to direct localized assembly of double-crossover (DX) tiles for solving prime factorization with a model consisting of the computing, decision-making, and reporting motifs. The model implementation is based on the sequential assembly of different DX tiles in the DOF cavity that carries overhangs encoding the prime and composite integers. The primes are multiplied and then verified with the composite, and the result is visualized under atomic force microscopy via the presence (success) or absence (failure) of biotin-streptavidin labels on the reporting DX tile. The factorization of semiprimes 6 and 15 is realized with this DOF-based demonstration. Given the potential of massively parallel processing ability of DNA, this strategy opens an avenue to solve complex mathematical puzzles like prime factoring with molecular computing.

Random Decompositions of Eulerian Statistics

This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of descents in random involutions and in random derangements are asymptotically normal with rates of convergence $\mathcal{O} (n^{-1/2})$ and $\mathcal{O}(n^{-1/3})$ respectively.

On the strange kinetic aesthetic of rectangular shape partitions

Abstract In this paper, we focus on shape partitions. We show that for any fixed k, one can symbolically characterize the shape partition on a k × n rectangular grid by a context-free grammar. We explicitly give this grammar for k = 2 and k = 3 (for k = 1, this corresponds to compositions of integers). From these grammars, we deduce the number of shape partitions for the k × n rectangular grids for k ∈ {1, 2, 3} and every n, as well as the limiting Gaussian distribution of the number of connected components. This also enables us to randomly and uniformly generate shape partitions of large size.

Speeding Up Fermat’s Factoring Method using Precomputation

The security of many public-key cryptosystems and protocols relies on the difficulty of factoring a large positive integer n into prime factors. The Fermat factoring method is a core of some modern and important factorization methods, such as the quadratic sieve and number field sieve methods. It factors a composite integer n=pq in polynomial time if the difference between the prime factors is equal to ∆=p-q≤n^(0.25) , where p>q. The execution time of the Fermat factoring method increases rapidly as ∆ increases. One of the improvements to the Fermat factoring method is based on studying the possible values of (n mod 20). In this paper, we introduce an efficient algorithm to factorize a large integer based on the possible values of (n mod 20) and a precomputation strategy. The experimental results, on different sizes of n and ∆, demonstrate that our proposed algorithm is faster than the previous improvements of the Fermat factoring method by at least 48%.

The leftmost column of ordered Chinese restaurant process up-down chains: intertwining and convergence

Recently there has been significant interest in constructing ordered analogues of Petrov’s two-parameter extension of Ethier and Kurtz’s infinitely-many-neutral-alleles diffusion model. One method for constructing these processes goes through taking an appropriate diffusive limit of Markov chains on integer compositions called ordered Chinese Restaurant Process up-down chains. The resulting processes are diffusions whose state space is the set of open subsets of the open unit interval. In this paper we begin to study nontrivial aspects of the order structure of these diffusions. In particular, for a certain choice of parameters, we take the diffusive limit of the size of the first component of ordered Chinese Restaurant Process up-down chains and describe the generator of the limiting process. We then relate this to the size of the leftmost maximal open subset of the open-set valued diffusions. This is challenging because the function taking an open set to the size of its leftmost maximal open subset is discontinuous. Our methods are based on establishing intertwining relations between the processes we study.

Pellian equations of special type

Abstract In this paper, we consider the solvability of the Pellian equation x 2 − ( d 2 + 1 ) y 2 = − m , $$\begin{array}{} \displaystyle x^2-(d^2+1)y^2 = -m, \end{array} $$ in cases d = nk , m = n 2l−1, where k, l are positive integers, n is a composite positive integer and d = pq, m = pq 2, p, q are primes. We use the obtained results to prove results on the extendibility of some D(−1)-pairs to quadruples in the ring Z [ − t ] $\begin{array}{} {\mathbb{Z}}[\sqrt{-t}] \end{array} $ , with t > 0.

On the Number of Primality Witnesses of Composite Integers

On the Number of Primality Witnesses of Composite Integers

Random Cyclic Triangle-Free Graphs of Prime Order

Cyclic triangle-free process (CTFP) is the cyclic analog of the triangle-free process. It begins with an empty graph of order n and generates a cyclic graph of order n by iteratively adding parameters, chosen uniformly at random, subject to the constraint that no triangle is formed in the cyclic graph obtained, until no more parameters can be added. The structure of a cyclic triangle-free graph of the prime order is different from that of composite integer order. Cyclic graphs of prime order have better properties than those of composite number order, which enables generating cyclic triangle-free graphs more efficiently. In this paper, a novel approach to generating cyclic triangle-free graphs of prime order is proposed. Based on the cyclic graphs of prime order, obtained by the CTFP and its variant, many new lower bounds on R 3 , t are computed, including R 3,34 ≥ 230 , R 3,35 ≥ 242 , R 3,36 ≥ 252 , R 3,37 ≥ 264 , R 3,38 ≥ 272 . Our experimental results demonstrate that all those related best known lower bounds, except the bound on R 3,34 , are improved by 5 or more.