相关论文: Gomory Integer Programs

A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…

We construct some new Integrable Systems (IS) both classical and quantum associated with elliptic algebras. Our constructions are partly based on the algebraic integrability mechanism given by the existence of commuting families in skew…

We study point modules of monomial algebras associated with symbolic dynamical systems, parametrized by proalgebraic varieties which 'linearize' the underlying dynamical systems. Faithful point modules correspond to transitive sub-systems,…

This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…

We show how to use extended word series in the reduction of continuous and discrete dynamical systems to normal form and in the computation of formal invariants of motion in Hamiltonian systems. The manipulations required involve complex…

In this paper, we introduce an algebra structure denoted by InvDer algebra whose which we twist an algebra thanks to an invertible derivation, where its inverse is also a derivation. We define InvDer Lie algebras, InvDer associated…

A complete choice of generators of the center of the enveloping algebras of real quasi-simple Lie algebras of orthogonal type, for arbitrary dimension, is obtained in a unified setting. The results simultaneously include the well known…

This article presents a natural extension of the tensor algebra. In addition to "left multiplications" by vectors, we can consider "derivations" by covectors as basic operators on this extended algebra. These two types of operators satisfy…

Let $M(n,\xi)$ be the moduli space of stable vector bundles of rank $n\geq 3$ and fixed determinant $\xi$ over a smooth projective algebraic curve $X$ over $\mathbb{C}$ of genus $g\geq 4.$ We use the gonality of the curve and $r$-Hecke…

We study families of cellular resolutions by looking at them as a category and applying tools from representation stability. We obtain sufficient conditions on the structure of the family to have a noetherian representation category and…

We discuss as a fundamental characteristic of orthogonal polynomials like the existence of a Lie algebra behind them, can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we put…

An algebra isomorphism between algebras of matrices and difference operators is used to investigate the discrete integrable hierarchy. We find local and non-local families of R-matrix solutions to the modified Yang-Baxter equation. The…

We give a characterization of symplectic quadratic Lie algebras that their Lie algebra of inner derivations has an invertible derivation. A family of symplectic quadratic Lie algebras is introduced to illustrate this situation. Finally, we…

The $\star_M$-family of tensor-tensor products is a framework which generalizes many properties from linear algebra to third order tensors. Here, we investigate positive semidefiniteness and semidefinite programming under the…

Let $\overline{\mathtt{X}}_\lambda$ be the closure of the $\mathtt{I}$-orbit $\mathtt{X}_\lambda$ in the affine Grassmanian $\mathtt{Gr}$ of a simple algebraic group $G$ of adjoint type, where $\mathtt{I}$ is the Iwahori group and $\lambda$…

We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which…

For linear recurrence systems, the problem of finding rational solutions is reduced to the problem of computing polynomial solutions by computing a content bound or a denominator bound. There are several bounds in the literature. The…

At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…

A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…

We employ tools from the fields of symbolic computation and satisfiability checking---namely, computer algebra systems and SAT solvers---to study the Williamson conjecture from combinatorial design theory and increase the bounds to which…