Related papers: Counting or producing all fixed cardinality transv…
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any…
We announce new methods for using prismatic cohomology to compute the K-groups of $\mathbb{Z}/p^n$ and related rings. We use computer algebra methods to compute these K-groups through a large range in specific cases and also obtain explicit…
We present a deterministic polynomial-time algorithm that determines whether a finite module over a finite commutative ring is cyclic, and if it is, outputs a generator.
Some general remarks about integral transform approaches to response functions are made. Their advantage for calculating cross sections at energies in the continuum is stressed. In particular we discuss the class of kernels that allow…
A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the feasible subsets of the given item set and show that this…
To measure an observable of a quantum mechanical system leaves it in one of its eigenstates and the result of the measurement is one of its eigenvalues. This process is shown to be a computational resource. It allows one, in principle, to…
The task of listing all triangles in an undirected graph is a fundamental graph primitive with numerous applications. It is trivially solvable in time cubic in the number of vertices. It has seen a significant body of work contributing to…
We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits…
We use group representation theory to give algebraic formulae to compute complete transversals of singularities of vector fields, either in the nonsymmetric or in the reversible equivariant contexts. This computation produces normal forms…
This thesis aims to invent new approaches for making inferences with the k-means algorithm. k-means is an iterative clustering algorithm that randomly assigns k centroids, then assigns data points to the nearest centroid, and updates…
A subset of positive integers $F$ is a Schreier set if it is non-empty and $|F|\leqslant \min F$ (here $|F|$ is the cardinality of $F$). For each positive integer $k$, we define $k\mathcal{S}$ as the collection of all the unions of at most…
A set of vertices $S$ is a \emph{determining set} of a graph $G$ if every automorphism of $G$ is uniquely determined by its action on $S$. The \emph{determining number} of $G$ is the minimum cardinality of a determining set of $G$. This…
We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of…
Comparison of three kind of the clustering and find cost function and loss function and calculate them. Error rate of the clustering methods and how to calculate the error percentage always be one on the important factor for evaluating the…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…
This paper provides a description of a new method for information processing based on holistic approach wherein analysis is a direct product of synthesis. The core of the method is iterative averaging of all the elements of a system…
Estimating cardinality, i.e., the number of distinct elements, of a data stream is a fundamental problem in areas like databases, computer networks, and information retrieval. This study delves into a broader scenario where each element…
Clustering is a common technique for statistical data analysis, which is used in many fields, including machine learning, data mining, pattern recognition, image analysis and bioinformatics. Clustering is the process of grouping similar…
A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine…