相关论文: On Resolvable Golomb Rulers, Symmetric Configurati…

We propose a new method for solution of the integrability problem for evolutionary differential-difference equations of arbitrary order. It enables us to produce necessary integrability conditions, to determine whether a given equation is…

Abraham, Dolev, Geffner, and Halpern proved that, in asynchronous systems, a $(k,t)$-robust equilibrium for $n$ players and a trusted mediator can be implemented without the mediator as long as $n > 4(k+t)$, where an equilibrium is…

The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to…

The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1…

Despite all attempts, exact solutions for black rings in more than five dimensions remain elusive. In this paper we clarify some of the reasons for that, in particular we show that a peculiar symmetry of the five--dimensional black ring -…

We present a novel family of slowly rotating black hole solutions in four, and higher dimensions, that extend the well known Lense-Thirring spacetime and solve the field equations to linear order in rotation parameter. As "exact metrics" in…

New exact modular branching rules are obtained for modules over the symmetric groups that are close to completely splittable modules. These results are based on some upper bounds for the Ext^1-spaces between simple modules.

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

Solvable structures are exploited in order to find families of explicit solutions to evolution PDEs admitting suitable differential constraints. The effectiveness of the method is verified on several explicit examples.

In this short note we explain how to construct resolutions or regular alterations admitting an ample exceptional divisor, assuming the existence of projective resolutions or regular alterations. In particular, this implies the existence of…

We propose a new kind of sliding-block puzzle, called Gourds, where the objective is to rearrange 1 x 2 pieces on a hexagonal grid board of 2n + 1 cells with n pieces, using sliding, turning and pivoting moves. This puzzle has a single…

We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…

We can break symmetry by eliminating solutions within each symmetry class. For instance, the Lex-Leader method eliminates all but the smallest solution in the lexicographical ordering. Unfortunately, the Lex-Leader method is intractable in…

In this paper, we develop a unified framework for studying constrained robust optimal control problems with adjustable uncertainty sets. In contrast to standard constrained robust optimal control problems with known uncertainty sets, we…

We give an affirmative answer to the Grunwald problem for new families of non-solvable finite groups G, away from the set of primes dividing |G|. Furthermore, we show that such G verify the condition (BM), that is, the Brauer-Manin…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…

A design is additive under an abelian group $G$ (briefly, $G$-additive) if, up to isomorphism, its point set is contained in $G$ and the elements of each block sum up to zero. The only known Steiner 2-designs that are $G$-additive for some…

Indistinguishable objects often occur when modelling problems in constraint programming, as well as in other related paradigms. They occur when objects can be viewed as being drawn from a set of unlabelled objects, and the only operation…

We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…