English
Related papers

Related papers: Feasible combinatorial matrix theory

200 papers

We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been…

Logic in Computer Science · Computer Science 2010-12-23 Sunil Kothari , James Caldwell

A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…

Combinatorics · Mathematics 2012-10-05 A. Nixon , J. C. Owen , S. C. Power

We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…

Logic in Computer Science · Computer Science 2018-04-24 Ştefan Ciobâcă , Dorel Lucanu

In our previous paper [SIMAX 31 n.3 1491-1506(2010)], we studied the condition metric in the space of maximal rank matrices. Here, we show that this condition metric induces a Lipschitz-Riemann structure on that space. After investigating…

Differential Geometry · Mathematics 2012-05-09 Carlos Beltrán , Jean-Pierre Dedieu , Gregorio Malajovich , Mike Shub

We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.

Logic in Computer Science · Computer Science 2007-05-23 Paolo Coppola , Simone Martini

Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading…

Computational Complexity · Computer Science 2022-03-08 Matthias Christandl , Péter Vrana , Jeroen Zuiddam

Let $\gg$ be a complex reductive Lie algebra and $\kk\subset\gg$ be any reductive in $\gg$ subalgebra. We call a $(\gg,\kk)$-module $M$ bounded if the $\kk$-multiplicities of $M$ are uniformly bounded. In this paper we initiate a general…

Representation Theory · Mathematics 2007-10-05 Ivan Penkov , Vera Serganova

A large class of two-dimensional $\mathcal{N}=(2,2)$ superconformal field theories can be understood as IR fixed-points of Landau-Ginzburg models. In particular, there are rational conformal field theories that also have a Landau-Ginzburg…

High Energy Physics - Theory · Physics 2015-06-11 Nicolas Behr , Stefan Fredenhagen

Nonnegative matrix factorization (NMF) has been shown to be identifiable under the separability assumption, under which all the columns(or rows) of the input data matrix belong to the convex cone generated by only a few of these columns(or…

Machine Learning · Statistics 2014-03-25 Jason Gejie Liu , Shuchin Aeron

For a finite dimensional algebra $\Lambda$ and a non-negative integer $n$, we characterize when the set $\tilt_n\Lambda$ of additive equivalence classes of tilting modules with projective dimension at most $n$ has a minimal (or…

Representation Theory · Mathematics 2020-08-05 Osamu Iyama , Xiaojin Zhang

We prove the canonicity of inductive inequalities in a constructive meta-theory, for classes of logics algebraically captured by varieties of normal and regular lattice expansions. This result encompasses Ghilardi-Meloni's and Suzuki's…

Logic · Mathematics 2023-06-22 Willem Conradie , Alessandra Palmigiano

We study the Kullback--Leibler (KL) divergence approximation theory of Gaussian mixture models (GMMs) by isolating an abstract mechanism behind several necessary-and-sufficient statements. The necessity direction is universal: if a density…

Statistics Theory · Mathematics 2026-04-14 Hien Duy Nguyen

Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…

Data Structures and Algorithms · Computer Science 2018-11-27 Martin Nägele , Benny Sudakov , Rico Zenklusen

In this paper we introduce a modal theory $H_{\sigma}$, which is sound and complete for arithmetical $\Sigma$_1 substitutions in ${\bf HA}$, in other words, we will show that $H_{\sigma}$ is the $\Sigma$_1-provability logic of ${\bf HA}$.…

Logic · Mathematics 2017-11-03 Mohammad Ardeshir , S. Mojtaba Mojtahedi

A very classical subject in Commutative Algebra is the Invariant Theory of finite groups. In our work on 3-dimensional topology (S. King, Ideal Turaev-Viro invariants. To appear in Top. Appl.), we found certain examples of group actions on…

Commutative Algebra · Mathematics 2007-05-23 Simon A. King

We discuss counterexamples to the validity of the weak Maximum Principle for linear elliptic systems with zero and first order couplings and prove, through a suitable reduction to a nonlinear scalar equation, a quite general result showing…

Analysis of PDEs · Mathematics 2021-06-11 I. Capuzzo Dolcetta , L. Rossi , A. Vitolo

We equip the space of lattice cones with a coproduct which makes it a connected cograded colagebra. The exponential sum and exponential integral on lattice cones can be viewed as linear maps on this space with values in the space of…

Mathematical Physics · Physics 2017-03-01 Li Guo , Sylvie Paycha , Bin Zhang

We prove that many of the results of the LMMP hold for $3$-folds over fields of characteristic $p>5$ which are not necessarily perfect. In particular, the existence of flips, the cone theorem, the contraction theorem for birational extremal…

Algebraic Geometry · Mathematics 2022-08-22 Omprokash Das , Joe Waldron

Some more general "inheritance conditions" have been found for a given set of symmetry generators $\{\mathbf{Z}_{\bar{l}}\}$ acting on some set of coupled ordinary differential equations, once the "first integration method" has been applied…

Classical Analysis and ODEs · Mathematics 2020-02-05 T. Pailas , P. A. Terzis , T. Christodoulakis

We here extend the well known Positive Real Lemma (also known as the Kalman-Yakubovich-Popov Lemma) to complex matrix-valued generalized positive rational function, when non-minimal realizations are considered. We then exploit this result…

Optimization and Control · Mathematics 2011-08-26 Daniel Alpay , Izchak Lewkowicz