Related papers: Supersolvable resolutions of line arrangements
When supersymmetry is spontaneously broken it will be generically non-linearly realized. A method to describe the non-linear realization of supersymmetry is with constrained superfields. We discuss the basic features of this description and…
We present a generic and systematic approach for constructing D-dimensional lattice models with exactly solvable d-dimensional boundary states localized to corners, edges, hinges and surfaces. These solvable models represent a class of…
A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…
A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…
In this paper a nonlinear coupled Schrodinger system in the presence of mixed cubic and superlinear power laws is considered. A non standard numerical method is developed to approximate the solutions in higher dimensional case. The idea…
We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…
We give improved lower bounds for the number of solutions of some $S$-unit equations over the integers, by counting the solutions of some associated linear equations as the coefficients in those equations vary over sparse sets. This method…
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.
We are concerned with the solvability of linear second order elliptic partial differential equations with nonlinear boundary conditions at resonance, in which the nonlinear boundary conditions perturbation is not necessarily required to…
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…
The absolute upper bound on the number of equiangular lines that can be found in $\mathbf{R}^d$ is $d(d+1)/2$. Examples of sets of lines that saturate this bound are only known to exist in dimensions $d=2,3,7$ or $23$. By considering the…
Resolvent compositions were recently introduced as monotonicity-preserving operations that combine a set-valued monotone operator and a bounded linear operator. They generalize in particular the notion of a resolvent average. We analyze the…
In this paper we give full classification of rank 3 line arrangements in $\mathbb P^2$ (over a field of characteristic 0) that have a minimal logarithmic derivation of degree 3. The classification presents their defining polynomials, up to…
Estimation of solution norms and stability for time-dependent nonlinear systems is ubiquitous in numerous applied and control problems. Yet, practically valuable results are rare in this area. This paper develops a novel approach, which…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
In the paper we are studying some properties of subsets Q of sums of dissociated sets. The exact upper bound for the number of solutions of the following equation (1) q_1 + ... + q_p = q_{p+1} + ... + q_{2p}, q_i \in Q in groups F_2^n is…
Motivated by Kohno's result on the holonomy Lie algebra of a hyperplane arrangement, we define the holonomy Lie algebra of a finite geometric lattice in a combinatorial way. For a solvable pair of lattices, we show that the holonomy Lie…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
Consider a real point configuration $\mathbf{A}$ of size $n$ and an integer $r \leq n$. The vertices of the $r$-lineup polytope of $\mathbf{A}$ correspond to the possible orderings of the top $r$ points of the configuration obtained by…
Boundary value problems for the nonlinear Schrodinger equation on the half line in laboratory coordinates are considered. A class of boundary conditions that lead to linearizable problems is identified by introducing appropriate extensions…