Related papers: Semi-canonical binary matrices
We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…
We give a canonical form of matrices of a cycle of linear or semilinear mapping V_1 --- V_2 --- ... --- V_t --- V_1 in which all V_i are complex vector spaces, each line is an arrow ---> or <---, and each arrow denotes a linear or…
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…
In this paper we present the set of saturated numerical semigroups with prime multiplicity. We also characterize the catenary degree of these semigroups that we acquire. The catenary degree of a numerical semigroup is the variant which…
Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…
We develop a functorial framework for the ideal theory of commutative semirings using coherent frames and spectral spaces. Two central constructions-the radical ideal functor and the $k$-radical ideal functor-are shown to yield coherent…
The process of canonical quantization is redefined so that the classical and quantum theories coexist when \hbar>0, just as they do in the real world. This analysis not only supports conventional procedures, it also reveals new quantization…
The article contains an overview of authors achievements in development of alternative quantum-chemical approaches oriented towards revival of the classical tradition of qualitative chemical thinking instead of obtaining numerical results.…
In this contribution, discrete semiclassical orthogonal polynomials of class $s\leq2$ are studied. By considering all possible solutions of the Pearson equation, we obtain the canonical families in each class. We also consider limit…
Narrowing and unification are very useful tools for symbolic analysis of rewrite theories, and thus for any model that can be specified in that way. A very clear example of their application is the field of formal cryptographic protocol…
We prove the finiteness of log pluricanonical representations for projective log canonical pairs with semi-ample log canonical divisor. As a corollary, we obtain that the log canonical divisor of a projective semi log canonical pair is…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
Binary Classification plays an important role in machine learning. For linear classification, SVM is the optimal binary classification method. For nonlinear classification, the SVM algorithm needs to complete the classification task by…
This paper is devoted to the presentation of combinatorial bialgebras whose coproduct is defined with the help of a commutative semigroup. We consider this setting in order to give a general framework which admits as special cases the…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…