English
Related papers

Related papers: The Reverse Tableaux: a Gateway to the Surjectivit…

200 papers

This is the second in a series math.AG/0312190, math.AG/0410267, math.AG/0410268 on configurations in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite collection of…

Algebraic Geometry · Mathematics 2016-09-07 Dominic Joyce

We developed an inverse design framework enabling automated generation of stable multi-component crystal structures by optimizing the formation energies in the latent space based on reversible crystal graphs with continuous representation.…

Materials Science · Physics 2021-04-21 Teng Long , Yixuan Zhang , Nuno M. Fortunato , Chen Shen , Mian Dai , Hongbin Zhang

We introduce an approach to counterfactual inference based on merging information from multiple datasets. We consider a causal reformulation of the statistical marginal problem: given a collection of marginal structural causal models (SCMs)…

Artificial Intelligence · Computer Science 2022-07-18 Luigi Gresele , Julius von Kügelgen , Jonas M. Kübler , Elke Kirschbaum , Bernhard Schölkopf , Dominik Janzing

The set of all subsets of any inverse semigroup forms an involution semiring under set-theoretical union and element-wise multiplication and inversion. We find structural conditions on a finite inverse semigroup guaranteeing that neither…

Group Theory · Mathematics 2024-03-13 Igor Dolinka , Sergey V. Gusev , Mikhail V. Volkov

We present a functorial construction which, starting from a congruence $\alpha$ of finite index in an algebra A, yields a new algebra C with the following properties: the congruence lattice of C is isomorphic to the interval of congruences…

Logic · Mathematics 2021-01-12 Peter Mayr , Agnes Szendrei

This paper falls within the general program of investigating the proof theoretic strength (in terms of reverse mathematics) of combinatorial principals which follow from versions of Ramsey's theorem. We examine two statements in graph…

Logic · Mathematics 2011-01-04 Peter Cholak , David Galvin , Reed Solomon

Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…

Combinatorics · Mathematics 2018-10-30 Sona Pavlikova , Daniel Sevcovic

For every positive integer h, the representation function of order h associated to a subset A of the integers or, more generally, of any group or semigroup X, counts the number of ways an element of X can be written as the sum (or product,…

Number Theory · Mathematics 2020-04-22 Melvyn B. Nathanson

The infinite upper triangular Pascal matrix is $T = [\binom{j}{i}]$ for $0\leq i,j$. It is easy to see that any leading principle square submatrix is triangular with determinant $1$, hence invertible. In this paper, we investigate the…

Numerical Analysis · Mathematics 2017-02-13 Scott N. Kersey

A graded poset structure is defined for the sets of Littlewood-Richardson (LR) tableaux that count the multiplicity of an irreducible GL(n)-module in the tensor product of irreducibles indexed by a sequence of rectangular partitions. This…

Quantum Algebra · Mathematics 2007-05-23 Mark Shimozono

Motivated by the study of Springer fibers and their totally nonnegative counterparts, we define a new subset of standard tableaux called Richardson tableaux. We characterize Richardson tableaux combinatorially using evacuation as well as in…

Combinatorics · Mathematics 2025-06-27 Steven N. Karp , Martha E. Precup

We call a unital locally convex algebra $A$ a continuous inverse algebra if its unit group $A^\times$ is open and inversion is a continuous map. For any smooth action of a, possibly infinite-dimensional, connected Lie group $G$ on a…

Operator Algebras · Mathematics 2008-02-22 Karl-Hermann Neeb

A rule for constructing interpolation nodes for $n$th degree polynomials on the simplex is presented. These nodes are simple to define recursively from families of 1D node sets, such as the Lobatto-Gauss-Legendre (LGL) nodes. The resulting…

Numerical Analysis · Mathematics 2020-08-11 Tobin Isaac

We describe a formalism, using groupoids, for the study of rewriting for presentations of inverse monoids, that is based on the Squier complex construction for monoid presentations. We introduce the class of pseudoregular groupoids, an…

Group Theory · Mathematics 2019-05-01 N. D. Gilbert , E. A. McDougall

In the additive topological group $(\mathbb{R},+)$ of real numbers, we construct families of sets for which elements are not measurable in the Lebesgue sense. The constructed families have algebraic structures of being semigroups (i.e.,…

Functional Analysis · Mathematics 2024-08-13 Venuste Nyagahakwa , Gratien Haguma , Joseline Munyaneza

We introduce and study transposed Poisson conformal superalgebras, the $\mathbb Z_2$-graded conformal analogues of transposed Poisson algebras, as well as their noncommutative variants. We derive a family of identities forced by the…

Rings and Algebras · Mathematics 2026-05-19 Hao Fang , Lamei Yuan

Let $G$ be a connected closed subgroup of $\mathrm{GL}_n(\mathbb{C})$ which is simple as a Lie group and which acts irreducibly on $\mathbb{C}^n$. Regarding both $G$ and its Lie algebra $\mathfrak{g}$ as subsets of $M_n(\mathbb{C})$, we…

Group Theory · Mathematics 2022-11-07 Michael J. Larsen

Let $G$ be a reductive group over a field $k$ of characteristic $\neq 2$, let ${\mathfrak g}=\Lie(G)$, let $\theta$ be an involutive automorphism of $G$ and let ${\mathfrak g}={\mathfrak k}\oplus{\mathfrak p}$ be the associated symmetric…

Rings and Algebras · Mathematics 2007-05-23 Paul Levy

Let $\mathfrak g$ be a simple Lie algebra with Cartan subalgebra $\mathfrak h$ and Weyl group $W$. We build up a graded map $(\mathcal H\otimes \bigwedge\mathfrak h\otimes \mathfrak h)^W\to (\bigwedge \mathfrak g\otimes \mathfrak…

Representation Theory · Mathematics 2017-07-06 Corrado De Concini , Paolo Papi

We study the "top-to-random-and-reverse shuffle", defined as the top-to-random shuffle in the symmetric group algebra composed with the permutation $w_0$ (which sends each $i$ to $n+1-i$). More generally, we analyze the composition of any…

Combinatorics · Mathematics 2025-08-12 Darij Grinberg , Jonathan Parlett
‹ Prev 1 4 5 6 7 8 10 Next ›