English
Related papers

Related papers: A short note on doubly substochastic analog of Bir…

200 papers

To a finite dimensional representation of a complex Lie group $G$, an associative algebra of adjoint covariant polynomial maps from the direct sum of $m$ copies of the Lie algebra $\mathfrak{g}$ of $G$ into an algebra of complex matrices is…

Representation Theory · Mathematics 2021-12-14 M. Domokos

Let $B$ be a ring, not necessarily commutative, having an involution $*$ and let ${\mathrm U}_{2m}(B)$ be the unitary group of rank $2m$ associated to a hermitian or skew hermitian form relative to $*$. When $B$ is finite, we construct a…

Representation Theory · Mathematics 2019-06-11 James Cruickshank , Luis Gutiérrez Frez , Fernando Szechtman

This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…

Geometric Topology · Mathematics 2025-02-11 Daniel An , Ruth Lawrence , Dennis Sullivan

It is shown that if $\gamma$ is a path of finite $p$ variation ($1\leq p< 2$) in a euclidean vector space and $f,g,h$ are Lipschitz functions on the trace of $\gamma$ then $s\mapsto F(s)=\int_\gamma f^sg dh$ defines an entire holomorphic…

Classical Analysis and ODEs · Mathematics 2016-01-14 Andrew Ursitti

Let $\V$ be a vector space over a field $\F$. Assume that the characteristic of $\F$ is \emph{large}, i.e. $char(\F)>\dim \V$. Let $T: \V \to \V$ be an invertible linear map. We answer the following question in this paper: When does $\V$…

Commutative Algebra · Mathematics 2013-08-14 Krishnendu Gongopadhyay , Ravi S. Kulkarni

Let us consider the following robust nonconvex quadratic optimization problem: \begin{equation*} \begin{split} \min &~ \dfrac{1}{2} x^\top Ax+a^\top x \\ \text{s.t.}~ & \alpha\leq\dfrac{1}{2}x^\top (B_1+\mu B_2)x+(b_1+\delta b_2)^\top x…

Optimization and Control · Mathematics 2022-10-06 F. Flores-Bazán , Y. García , A. Pérez

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Combinatorics · Mathematics 2008-01-29 Joshua Cooper , Andrew Petrarca

In this paper, we investigate a formula to solve systems of the form (B + {\sigma}I)x = y, where B is a limited-memory BFGS quasi-Newton matrix and {\sigma} is a positive constant. These types of systems arise naturally in large-scale…

Numerical Analysis · Mathematics 2012-02-02 Jennifer B. Erway , Roummel F. Marcia

A modification of the usual extended N = 2 supersymmetry algebra implementing the two dimensional permutation group is performed. It is shown that one can found a multiplet that forms an off-shell realization of this alternative extension…

High Energy Physics - Theory · Physics 2013-10-25 Nazim Djeghloul , Mohamed Tahiri

In earlier papers, we showed a decomposition of the arcs of 2-diregular digraphs (2-dds) and used it to prove some conditions for these graphs to be non-Hamiltonian; we then extended this decomposition to a larger class of digraphs and used…

Combinatorics · Mathematics 2026-01-27 Munagala V. Ramanath

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

In this paper, we introduce a definition of BV functions in a Gelfand triple which is an extension of the definition of BV functions in [2] by using Dirichlet form theory. By this definition, we can consider the stochastic reflection…

Probability · Mathematics 2018-06-18 Michael Michael Röckner , Rong-Chan Zhu , Xiang-Chan Zhu

For positive semidefinite $n\times n$ matrices $A$ and $B$, the singular value inequality $(2+t)s_{j}(A^{r}B^{2-r}+A^{2-r}B^{r})\leq 2s_{j}(A^{2}+tAB+B^{2})$ is shown to hold for $r=\frac{1}{2}, 1, \frac{3}{2}$ and all $-2<t\leq 2$.

Functional Analysis · Mathematics 2013-10-18 R. Dumitru , R. Levanger , B. Visinescu

This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…

Combinatorics · Mathematics 2010-08-17 Li Liu , Yi Wang

The way to arrive at formula of zeta matrix for any graded posets with the finite set of minimal elements is delivered following the first reference. This is being achieved via adjacency and zeta matrix description of bipartite digraphs…

Combinatorics · Mathematics 2011-05-19 A. K. Kwasniewski

We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…

Optimization and Control · Mathematics 2020-01-01 Michal Černý , Milan Hladík , Miroslav Rada

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

Combinatorics · Mathematics 2007-05-23 Robert Guralnick , David Perkinson

Fix a natural $\alpha$. Let $n\ge \alpha$ be an integer. Consider the symmetric group $S_{\alpha+n}$ and its subgroup $S_n$. We consider the group algebra of $S_{\alpha+n}$ and its subalgebra $\mathbb{O}[\alpha;n]$ consisting of…

Representation Theory · Mathematics 2025-08-25 Yury A. Neretin

It is well-known that any permutation can be written as a product of two involutions. We provide an explicit formula for the number of ways to do so, depending only on the cycle type of the permutation. In many cases, these numbers are sums…

Combinatorics · Mathematics 2012-02-27 T. Kyle Petersen , Bridget Eileen Tenner

Semi-automata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs. Generalized semiautomata are obtained from stochastic semiautomata by dropping the restrictions imposed by…

Formal Languages and Automata Theory · Computer Science 2020-04-21 Merve Nur Cakir , Karl-Heinz Zimmermann
‹ Prev 1 8 9 10 Next ›