相关论文: A generalization of balanced tableaux and marriage…
Let $\mathbf{A}_{n, m}$ be the polynomial ring $\text{Sym}(\mathbf{C}^n \otimes \mathbf{C}^m)$ with the natural action of $\mathbf{GL}_m(\mathbf{C})$. We construct a family of $\mathbf{GL}_m(\mathbf{C})$-stable ideals $J_{n, m}$ in…
Let $\Omega$ be a nonempty closed and convex subset of a uniformly smooth and uniformly convex real Banach space $\mathcal{X}$ with dual space $\mathcal{X}^*$. This article presents a hybrid algorithm for finding a common element of the set…
It is shown that there exists a normal uniform algebra, on a compact metrizable space, that fails to be strongly regular at some peak point. This answers a 31-year-old question of Joel Feinstein. Our example is R(K) for a certain compact…
In this paper, we introduce a generalization of Balancing and Balancing-Lucas numbers. We describe some of their properties also we give the related matrix representation and divisibility properties.
Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…
Signed networks, characterized by edges labeled as either positive or negative, offer nuanced insights into interaction dynamics beyond the capabilities of unsigned graphs. Central to this is the task of identifying the maximum balanced…
We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…
In this paper, we give a new and efficient algebraic criterion for the pure as well as non-pure shellability of simplicial complex $\Delta$ over [n]. We also give an algebraic characterization of a leaf in a simplicial complex (defined in…
We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabitation in an intersection type system P based on…
We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…
We prove a structure theorem for periodic locally soluble groups satisfying a chain condition on intersections of relatively uniformly definable subgroups using results from the theory of stable groups. The result in particular shows that…
This paper generalizes Shelah's generic pair conjecture (now theorem) for the measurable cardinal case from first order theories to finite diagrams. We use homogeneous models in the place of saturated models.
In this paper we consider a class of conjugate equations, which generalizes de Rham's functional equations. We give sufficient conditions for existence and uniqueness of solutions under two different series of assumptions. We consider…
Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments…
A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal F$ of subsets of $[n]$ with all pairwise intersections of size $\lambda$ can have at most $n$ non-empty sets. One may weaken the…
An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…
An interesting observation is that most pairs of weakly homogeneous mappings have no strongly monotonic property, which is one of the key conditions to ensure the unique solvability of the generalized variational inequality. This paper…
A common measure of a function's complexity is the count of its stationary points. For complicated functions, this count grows exponentially with the volume and dimension of their domain. In practice, the count is averaged over a class of…
We introduce squared families, which are families of probability densities obtained by squaring a linear transformation of a statistic. Squared families are singular, however their singularity can easily be handled so that they form regular…
We consider a weighted counting problem on matchings, denoted $\textrm{PrMatching}(\mathcal{G})$, on an arbitrary fixed graph family $\mathcal{G}$. The input consists of a graph $G\in \mathcal{G}$ and of rational probabilities of existence…