English
Related papers

Related papers: Combinatorial Reduction of Set Functions and Matro…

200 papers

We study local generalized additive decompositions (GADs) of homogeneous polynomials and their associated point schemes through their local inverse systems. We prove that their construction and algebraic properties are independent of the…

Commutative Algebra · Mathematics 2026-03-11 Oriol Reig Fité , Daniele Taufer

The so-called "pinched disk" model of the Mandelbrot set is due to A.~Douady, J.~H.~Hubbard and W.~P.~Thurston. It can be described in the language of geodesic laminations. The combinatorial model is the quotient space of the unit disk…

Dynamical Systems · Mathematics 2017-05-31 Alexander Blokh , Lex Oversteegen , Ross Ptacek , Vladlen Timorin

Rosengren and Schlosser introduced notions of ${\it R}_N$-theta functions for the seven types of irreducible reduced affine root systems, ${\it R}_N={\it A}_{N-1}$, ${\it B}_{N}$, ${\it B}^{\vee}_N$, ${\it C}_{N}$, ${\it C}^{\vee}_N$, ${\it…

Probability · Mathematics 2019-02-08 Makoto Katori

In this paper, we propose an algebraic approach to determine whether two non-isomorphic caterpillar trees can have the same symmetric function generalization of the chromatic polynomial. On the set of all composition on integers, we…

Combinatorics · Mathematics 2012-08-09 José Aliste-Prieto , José Zamora

A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…

Optimization and Control · Mathematics 2026-02-13 Shravan Mohan

The product of M complex random Gaussian matrices of size N has recently been studied by Akemann, Kieburg and Wei. They showed that, for fixed M and N, the joint probability distribution for the squared singular values of the product matrix…

Mathematical Physics · Physics 2015-06-15 Lun Zhang

We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if…

Discrete Mathematics · Computer Science 2009-04-21 Daniel Kral

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

Combinatorics · Mathematics 2012-04-24 Ferenc Szöllősi

Sparse matrix factorization is a popular tool to obtain interpretable data decompositions, which are also effective to perform data completion or denoising. Its applicability to large datasets has been addressed with online and randomized…

Machine Learning · Statistics 2017-11-15 Arthur Mensch , Julien Mairal , Bertrand Thirion , Gaël Varoquaux

We study determinantal point processes on $\mathbb{C}$ induced by the reproducing kernels of generalized Fock spaces as well as those on the unit disc $\mathbb{D}$ induced by the reproducing kernels of generalized Bergman spaces. In the…

Probability · Mathematics 2016-12-01 Alexander I. Bufetov , Yanqi Qiu

We provide a recursive method for constructing product formula approximations to exponentials of commutators, giving the first approximations that are accurate to arbitrarily high order. Using these formulas, we show how to approximate…

Quantum Physics · Physics 2013-11-22 Andrew M. Childs , Nathan Wiebe

We provide a concise exposition with original proofs of combinatorial formulas for the 2D Ising model partition function, multi-point fermionic observables, spin and energy density correlations, for general graphs and interaction constants,…

Combinatorics · Mathematics 2019-03-15 Dmitry Chelkak , David Cimasoni , Adrien Kassel

This paper is a continuation of our papers \cite{EK1, EK2}. In \cite{EK2} we showed that for the root system $A_{n-1}$ one can obtain Macdonald's polynomials as weighted traces of intertwining operators between certain finite-dimensional…

High Energy Physics - Theory · Physics 2008-02-03 Pavel Etingof , Alexander Kirillov

We investigate tensor products of matrix factorisations. This is most naturally done by formulating matrix factorisations in terms of bimodules instead of modules. If the underlying ring is C[x_1,...,x_N] we show that bimodule matrix…

Mathematical Physics · Physics 2014-11-20 Nils Carqueville , Ingo Runkel

We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the…

Group Theory · Mathematics 2007-05-23 Jean-Camille Birget

We present a theory for Euclidean dimensionality reduction with subgaussian matrices which unifies several restricted isometry property and Johnson-Lindenstrauss type results obtained earlier for specific data sets. In particular, we…

Information Theory · Computer Science 2014-02-18 Sjoerd Dirksen

A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…

Combinatorics · Mathematics 2014-11-20 Ron M. Adin , Yuval Roichman

In [8] a notion of generalized Hadamard product was introduced. We show that when certain kinds of tensors interact with the eigenvalues of symmetric matrices the resulting formulae can be nicely expressed using the generalized Hadamard…

Optimization and Control · Mathematics 2007-05-23 Hristo S. Sendov

We introduce a family of discrete analytic functions, called expandable discrete analytic functions, which includes discrete analytic polynomials, and define two products in this family. The first one is defined in a way similar to the…

Functional Analysis · Mathematics 2012-08-21 Daniel Alpay , Palle Jorgensen , Ron Seager , Dan Volok

In this work it is shown that the SD-KE decomposition is multiplicative under determinantal-type functions for graphs with perfect matchings, providing a new tool for the study of unimodular and singular matchable graphs.

Combinatorics · Mathematics 2026-03-03 Daniel A. Jaume , Diego G. Martinez , Cristian Panelo , Kevin Pereyra
‹ Prev 1 8 9 10 Next ›